The tree language L ( A ) accepted .
The tree language L ( A ) recognized , by a tree automaton A is the set of all ground terms accepted by A .
The tree language L ( A ) accepted , or recognized , by a tree automaton A is the set of all ground terms accepted by A .