Sciweavers

ICALP
2004
Springer

Tree-Walking Automata Cannot Be Determinized

13 years 9 months ago
Tree-Walking Automata Cannot Be Determinized
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. Key words: Tree-walking automata, deterministic tree-walking automata.
Mikolaj Bojanczyk, Thomas Colcombet
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where ICALP
Authors Mikolaj Bojanczyk, Thomas Colcombet
Comments (0)