Assertion: tree automaton | /r/HasProperty | complete
Facets:
Source sentences:
text: A non-deterministic finite tree automaton is complete if there is at least one transition rule available for every possible symbol-states combination.