Assertion: tree automaton | /r/CapableOf | start at all its leaves
Facets:
value: simultaneously
type: MANNER
Source sentences:
text: 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.