Tree-walking automaton

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.

  1. ^ Aho, A; Ullman, J (1971). "Translations on a context free grammar". Information and Control. 19 (5): 439–475. doi:10.1016/S0019-9958(71)90706-6.