On Asynchronous Tree Automata
Ferenc Gécseg, Balázs Imreh · Journal of automata, languages and combinatorics · 2006
In this work we introduce asynchronous tree automata. First isomorphically complete systems for the class of asynchronous tree automata are characterized with respect to the $\alpha_i$-products, then tree languages recognizable by asynchronous tree automata are described.