A tree-walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed by Aho and Ullman.[1]
The following article deals with tree-walking automata. For a different notion of tree automaton, closely related to regular tree languages, see branching automaton.