Complementing deterministic tree-walking automata

Information Processing Letters

Volumn 99, Issue 1, 2006, Pages 33-39

  Muscholl, Anca ^a   Samuelides, Mathias ^b   Segoufin, Luc ^c  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b INRIA   (France)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Combinatorial problems; Formal languages; Tree automata

Indexed keywords

COMBINATORIAL MATHEMATICS; DATA PROCESSING; FORMAL LANGUAGES; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

COMBINATORIAL PROBLEMS; TREE AUTOMATA; TREE-WALKING AUTOMATA;

AUTOMATA THEORY;

EID: 33747890922     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.09.017     Document Type: Article

References (9)

1. Aho A.V., and Ullman J.D. Translations on a context-free grammar. Information and Control 19 5 (1971) 439-475
2. M. Bojanczyk, T. Colcombet, Tree walking automata cannot be determinized, in: Proc. of Internat. Coll. on Automata, Languages and Programming, 2004
3. M. Bojanczyk, T. Colcombet, Tree-walking automata do not recognize all regular languages, in: Proc. ACM SIGACT Symp. on Theory of Computing, 2005
4. Comon H., Dauchet M., Gilleron R., Jacquemard F., Lugiez D., Tison S., and Tommasi M. Tree automata techniques and applications. Available at (1999). http://www.grappa.univ-lille3.fr/tata
5. J. Engelfriet, H.J. Hoogeboom, Automata with nested pebbles capture first-order logic with transitive closure, Technical Report 05-02, Leiden Institute of Advanced Computer Science, Leiden University, April 2005
6. Engelfriet J., and Hoogeboom H.J. Tree-walking pebble automata. In: Karhumäki J., Maurer H., Paun G., and Rozenberg G. (Eds). Jewels Are Forever, Contributions to Theoretical Computer Science in Honor of Arto Salomaa (1999), Springer-Verlag, Berlin 72-83
7. Globerman N., and Harel D. Complexity results for two-way and multi-pebble automata and their logics. Theoretical Computer Science 169 2 (1996) 161-184
8. Milo T., Suciu D., and Vianu V. Typechecking for XML transformers. Journal of Computer and System Sciences 66 1 (2003) 66-97
9. M. Sipser, Halting space-bounded computations, in: IEEE Conf. on Foundations of Computer Science, 1978, pp. 73-74