JUCS - Journal of Universal Computer Science 8(2): 184-192, doi: 10.3217/jucs-008-02-0184
On Quasi-Products of Tree Automata
expand article infoFerenc Gécseg‡
‡ University of Szegeds, Hungary

Corresponding author: Ferenc Gécseg ( gecseg@inf.u-szeged.hu )

© Ferenc Gécseg.
This article is freely available under the J.UCS Open Content License.
Citation: Gécseg F (2002) On Quasi-Products of Tree Automata. JUCS - Journal of Universal Computer Science 8(2): 184-192. https://doi.org/10.3217/jucs-008-02-0184
Open Access
Abstract
In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in which permutation and unification of variables are allowed. It is shown that in sets of tree automata which are homomorphically complete with respect to the quasi-product the essentially unary operations play the basic role among all operations with nonzero ranks. Furthermore, we give a characterization of homomorphically complete sets which is similar to the classical one. 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen.
Keywords
tree automata, products, complete sets