Tree-walking automata cannot be determinized

Authors:
Mikołaj Bojańczyk;Thomas Colcombet
Affiliations:
Institute of Informatics, Warsaw University, Banacha, Warsaw, Poland;Institute of Informatics, Warsaw University, Banacha, Warsaw, Poland
Venue:
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Year:
2006

Citing 2
Cited 8

Trips on trees

Acta Cybernetica
Tree-Walking Pebble Automata

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa

Tree-Walking Automata

Language and Automata Theory and Applications
Pebble alternating tree-walking automata and their recognizing power

Acta Cybernetica
Deciding determinism of caterpillar expressions

Theoretical Computer Science
Deterministic caterpillar expressions

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Loops and overloops for tree walking automata

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Expressive power of pebble automata

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Loops and overloops for Tree-Walking Automata

Theoretical Computer Science
Complexity of pebble tree-walking automata

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is shown that deterministic tree-walking automata are weaker than nondeterministic tree-walking automata.