ON SOME CLASSES OF TREE AUTOMATA AND TREE LANGUAGES
Ferenc Gécseg · Annales Academiae Scientiarum Fennicae Mathematica · 2000
In this paper we give a structural characterization of three classes of tree au- tomata. Namely, we shall homomorphically represent the classes of nilpotent, deflnite, and mono- tone tree automata by means of quasi-cascade-products of unary nilpotent and unary deflnite tree automata in the flrst two cases, and by means of products of simpler tree automata in the third case.