Assertion: tree automaton | /r/HasAspect | same expressive power
Facets:
Source sentences:
text: 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.