Assertion: tree automaton | /r/Synonym | nondeterministic nfta
Facets:
Source sentences:
text: A tree automaton is called deterministic (abbreviated DFTA) if no two rules from Δ have the same left hand side; otherwise it is called nondeterministic (NFTA).