Assertion: tree automaton | /r/DefinedAs | tuple
Facets:
Source sentences:
text: A bottom-up finite tree automaton over F is defined as a tuple (Q, F, Q f , Δ), where Q is a set of states, F is a ranked alphabet (i.e., an alphabet whose symbols have an associated arity), Q f ⊆ Q is a set of final states, and Δ is a set of transition rules of the form f(q 1 (x 1 ),...,
text: A top-down finite tree automaton over F is defined as a tuple (Q, F, Q i , Δ), with two differences with bottom-up tree automata.