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.

• Type: Conference
• Year: 2004
• Where: ICALP
• Authors: Mikolaj Bojanczyk, Thomas Colcombet
• Keywords: Deterministic Tree-walking Automata, ICALP 2004, Such Automata Walk, Theoretical Computer Science, Tree-walking Automata