Tree-walking automata do not recognize all regular languages

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 234-243

  Bojanczyk, Mikolaj ^a,b   Colcombet, Thomas ^a,c  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c CAMPUS DE BEAULIEU   (France)

Author keywords

Theory

Indexed keywords

FIRST-ORDER LOGIC; NATURAL SEQUENTIAL MODEL; TREE LANGUAGES; TREE-WALKING AUTOMATA;

COMPUTER PROGRAMMING LANGUAGES; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FORMAL LANGUAGES; FORMAL LOGIC; TREES (MATHEMATICS);

AUTOMATA THEORY;

EID: 34848901704     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060626     Document Type: Conference Paper

References (7)

1. A. V. Aho and J. D. Ullman. Translations on a Context-Free Grammar. Information and Control, 19, pp. 439-475 (1971).
2. M. Bojańczyk. 1-Bounded TWA Cannot Be Determinized. Foundations of Software Technology and Theoretical Computer Science, LNCS 2914, pp. 62-73 (2003)
3. M. Bojańczyk and T. Colcombet. Tree-Walking Automata Cannot Be Determinized. International Colloquium on Automata, Languages and Programming, LNCS 3142, pp. 246-256 (2004)
4. J. Engelfriet and H. Hoogeboom and J. Van Best. Trips on Trees. Acta Cybernetica, 14:1, pp. 51-64 (1999)
5. J. Engelfriet and H. J. Hoogeboom. Tree-Walking Pebble Automata. Jewels Are Forever, Contributions to Theoretical Computer Science in Honor of Arto Salomaa, Springer-Verlag, pp. 72-83 (1999)
6. , T. Kamimura and G. Slutzki. Parallel Two-Way Automata on Directed Ordered Acyclic Graphs. Information and Control, 49:1, pp. 10-51 (1981)
7. F. Neven and T. Schwentick. On the Power of Tree-Walking Automata. International Colloquium on Automata, Languages and Programming, LNCS 1853 (2000)