Tree automaton
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.
As with classical automata, finite tree automata 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: bottom up, top down. This is an important issue, as although non-deterministic 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.
Definitions
A bottom-up finite tree automaton over F is defined as a tuple,
where Q is a set of states, F is a ranked alphabet, Qf ⊆ Q is a set of final states, and Δ is a set of transition rules of the form f,...,qn) → q, for an n-ary f ∈ F, q, qi ∈ Q, and xi variables denoting subtrees. That is, members of Δ are rewrite rules from nodes whose childs' roots are states, to nodes whose roots are states. Thus the state of a node is deduced from the states of its children.
For n=0, that is, for a constant symbol f, the above transition rule definition reads f → q); often the empty parentheses are omitted for convenience: f → q.
Since these transition rules for constant symbols do not require a state, no explicitly defined initial states are needed.
A bottom-up tree automaton is run on a ground term over F, starting at all its leaves simultaneously and moving upwards, associating a run state from Q with each subterm.
The term is accepted if its root is associated to an accepting state from Qf.
A top-down finite tree automaton over F is defined as a tuple
,
with two differences with bottom-up tree automata. First, Qi ⊆ Q, the set of its initial states, replaces Qf; second, its transition rules are oriented conversely:
q → f,...,qn), for an n-ary f ∈ F, q, qi ∈ Q, and xi variables denoting subtrees.
That is, members of Δ are here rewrite rules from nodes whose roots are states to nodes whose childs' roots are states.
A top-down automaton starts in some of its initial states at the root and moves downward along branches of the tree, associating along a run a state with each subterm inductively.
A tree is accepted if every branch can be gone through this way.
A tree automaton is called deterministic if no two rules from Δ have the same left hand side; otherwise it is called nondeterministic. Non-deterministic top-down tree automata have the same expressive power as non-deterministic bottom-up ones; the transition rules are simply reversed, and the final states become the initial states.
In contrast, deterministic top-down tree automata are less powerful than their bottom-up counterparts, because in a deterministic tree automaton no two transition rules have the same left-hand side. For tree automata, transition rules are rewrite rules; and for top-down ones, the left-hand side will be parent nodes. Consequently, a deterministic top-down tree automaton will only be able to test for tree properties that are true in all branches, because the choice of the state to write into each child branch is determined at the parent node, without knowing the child branches contents.
Examples
Bottom-up automaton accepting boolean lists
Employing coloring to distinguish members of F and Q, and using the ranked alphabet F=, with having arity 2 and all other symbols having arity 0, a bottom-up tree automaton accepting the set of all finite lists of boolean values can be defined as with, Qf=, and Δ consisting of the rulesIn this example, the rules can be understood intuitively as assigning to each term its type in a bottom-up manner; e.g. rule can be read as "A term has type, provided x1 and x2 has type and, respectively".
An accepting example run is
Cf. the derivation of the same term from a regular tree grammar corresponding to the automaton, shown at Regular tree grammar#Examples.
An rejecting example run is
Intuivitvely, this corresponds to the term not being well-typed.
Top-down automaton accepting multiples of 3 in binary notation
| ' | ' | ' | ' | |
| String grammar rules | String automaton transitions | Tree automaton transitions | Tree grammar rules | |
Using the same colorization as above, this example shows how tree automata generalize ordinary string automata. The finite deterministic string automaton shown in the picture accepts all strings of binary digits that denote a multiple of 3. Using the notions from Deterministic finite automaton#Formal definition, it is defined by:
For example, the binary string "" in the string automaton setting corresponds to the term "))" in the tree automaton setting; this way, strings can be generalized to trees, or terms. The top-down finite tree automaton accepting the set of all terms corresponding to multiples of 3 in binary string notation is then defined by:
In contrast, the term ")" leads to following non-accepting automaton run: Since there are no other initial states than to start an automaton run with, the term ")" is not accepted by the tree automaton. For comparison purposes, the table gives in column and a regular grammar, and a regular tree grammar, respectively, each accepting the same language as its automaton counterpart. PropertiesRecognizabilityFor a bottom-up automaton, a ground term t is accepted if there exists a reduction that starts from t and ends with q, where q is a final state. For a top-down automaton, a ground term t is accepted if there exists a reduction that starts from q and ends with t, where q is an initial state.The tree language L accepted, or recognized, by a tree automaton A is the set of all ground terms accepted by A. A set of ground terms is recognizable if there exists a tree automaton that accepts it. A linear tree homomorphism preserves recognizability. Completeness and reductionA non-deterministic finite tree automaton is complete if there is at least one transition rule available for every possible symbol-states combination.A state q is accessible if there exists a ground term t such that there exists a reduction from t to q. An NFTA is reduced if all its states are accessible. Pumping lemmaEvery sufficiently large ground term t in a recognizable tree language L can be vertically tripartited such that arbitrary repetition of the middle part keeps the resulting term in L.For the language of all finite lists of boolean values from the above example, all terms beyond the height limit k=2 can be pumped, since they need to contain an occurrence of. For example, all belong to that language. ClosureThe class of recognizable tree languages is closed under union, under complementation, and under intersection.Myhill–Nerode theoremA congruence on the set of all trees over a ranked alphabet F is an equivalence relation such that u1 ≡ v1 and... and un ≡ vn implies f ≡ f, for every f ∈ F.It is of finite index if its number of equivalence-classes is finite. For a given tree-language L, a congruence can be defined by u ≡L v if C ∈ L ⇔ C ∈ L for each context C. The Myhill–Nerode theorem for tree automaton states that the following three statements are equivalent:
|