A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines.
The following article deals with branching tree automata, which correspond to regular languages of trees. For a different notion of tree automaton, see tree walking automaton.
As with classical automata, finite tree automata (FTA) can be either a deterministic automaton or not. According to how the automaton processes the input tree, finite tree automata can be of two types: (a) bottom up, (b) top down. This is an important issue, as although non-deterministic (ND) top-down and ND bottom-up tree automata are equivalent in expressive power, deterministic top-down automata are strictly less powerful than their deterministic bottom-up counterparts, because tree properties specified by deterministic top-down tree automata can only depend on path properties. (Deterministic bottom-up tree automata are as powerful as ND tree automata.)
Read more about Tree Automaton: Definitions
Famous quotes containing the word tree:
“But when the bowels of the earth were sought,
And men her golden entrails did espy,
This mischief then into the world was brought,
This framed the mint which coined our misery.
...
And thus began th’exordium of our woes,
The fatal dumb-show of our misery;
Here sprang the tree on which our mischief grows,
The dreary subject of world’s tragedy.”
—Michael Drayton (1563–1631)