Tree-walking automata cannot be determinized

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 246-256

  Bojańczyk, Mikołaj ^a   Colcombet, Thomas ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORESTRY;

SEQUENTIAL MODEL; TREE LANGUAGES; TREE-WALKING AUTOMATON;

AUTOMATA THEORY;

EID: 35048866311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_23     Document Type: Article

References (6)

1. A. V. Aho and J. D. Ullman. Translations on a context-free grammar. Information and Control, 19(5):439-475, dec 1971.
2. M. Bojańczyk. 1-bounded TWA cannot be determinized. In FSTTCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, volume 2914 of Lecture Notes in Computer Science, pages 62,73. Springer, 2003.
3. J. Engelfriet and H. J. Hoogeboom. Tree-walking pebble automata. In G. Paum J. Karhumaki, H. Maurer and G. Rozenberg, editors, Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa, pages 72-83. Springer-Verlag, 1999.
4. J. Engelfriet, H. J. Hoogeboom, and J.-P. van Best. Trips on trees. Acta Cybernetica, 14:51-64, 1999.
5. T. Kamimura and G. Slutzki. Parallel two-way automata on directed ordered acyclic graphs. Information and Control, 49(1):10-51, 1981.
6. F. Neven and T. Schwentick. On the power of tree-walking automata. In Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, volume 1853 of LNCS, 2000.