Tree-walking automata cannot be determinized

Theoretical Computer Science

Volumn 350, Issue 2-3, 2006, Pages 164-173

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

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Deterministic tree walking automata; Tree walking automata

Indexed keywords

AUTOMATA THEORY; CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; FORMAL LANGUAGES; LEARNING SYSTEMS;

DETERMINISTIC TREE-WALKING AUTOMATA; FINITE TREES; NATURAL SEQUENTIAL MODELS; TREE-WALKING AUTOMATA;

COMPUTER APPLICATIONS;

EID: 30844470639     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.10.031     Document Type: Conference Paper

References (8)

1. A.V. Aho, and J.D. Ullman Translations on a context-free grammar Inform. and Control 19 5 1971 439 475
2. M. Blum, and C. Hewitt Automata on a 2-dimensional tape Symp. Switching and Automata Theory 1967 155 160
3. M. Bojańczyk, 1-bounded TWA cannot be determinized, in: 23rd Conf. Foundations of Software Technology and Theoretical Computer Science, FSTTCS'03, Lecture Notes in Computer Science, Vol. 2914, Springer, Berlin, 2003, pp. 62, 73.
4. J. Engelfriet, and H.J. Hoogeboom Tree-walking pebble automata G. Paum J. Karhumaki H. Maurer G. Rozenberg Jewels Are Forever, Contributions to Theoretical Computer Science in Honor of Arto Salomaa 1999 Springer Berlin 72 83
5. J. Engelfriet, H.J. Hoogeboom, and J.-P. van Best Trips on trees Acta Cybernetica 14 1999 51 64
6. J.M. Howie Fundamentals of Semigroup Theory 1996 Oxford University Press Oxford
7. T. Kamimura, and G. Slutzki Parallel two-way automata on directed ordered acyclic graphs Inform. and Control 49 1 1981 10 51
8. F. Neven, T. Schwentick, On the power of tree-walking automata, in: 27th Internat. Colloq. Automata, Languages and Programming, ICALP'00, Lecture Notes in Computer Science, Vol. 1853, 2000.