Publikationen von Karianto Wong

Alle Publikationen

[LW09] Christof Löding and Karianto Wong. On nondeterministic unranked tree automata with sibling constraints. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz Center for Informatics, 2009. To appear.
[ Abstract ]
[KL07] Wong Karianto and Christof Löding. Unranked tree automata with sibling equalities and disequalities. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming, ICALP 2007, volume 4596 of Lecture Notes in Computer Science, pages 875-887. Springer, 2007. (c) Springer.
[ pdf | Abstract ]
[KKT06] Wong Karianto, Aloys Krieg, and Wolfgang Thomas. On intersection problems for polynomially generated sets. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, Part II, volume 4052 of Lecture Notes in Computer Science, pages 516-527. Springer, 2006. (c) Springer.
[ pdf | ps | Abstract ]
[KL06] Wong Karianto and Christof Löding. Unranked tree automata with sibling equalities and disequalities. Technical Report AIB-2006-13, RWTH Aachen, October 2006.
[ pdf | ps | Abstract ]
[Kar05a] Wong Karianto. Adding monotonic counters to automata and transition graphs. In Proceedings of the 9th International Conference on Developments in Language Theory, DLT 2005, volume 3572 of Lecture Notes in Computer Science, pages 308-319. Springer, 2005. (c) Springer.
[ pdf | ps | Abstract ]
[Kar05b] Wong Karianto. On Parikh images of higher-order pushdown automata. In 15. Theorietag der GI Fachgruppe 0.1.5 Automaten und Formale Sprachen, Technical Report WSI-2005-16, pages 26-29. Wilhelm-Schickard-Institut für Informatik, Eberhard-Karls-Universität Tübingen, 2005.
[ pdf | ps | Abstract ]
[Kar04] Wong Karianto. Parikh automata with pushdown stack. Diplomarbeit, RWTH Aachen, 2004.
[ pdf | Abstract ]