Article ID Journal Published Year Pages File Type
439385 Theoretical Computer Science 2006 10 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics