| Research>>> Acta Cybernetica>>> Previous Volumes>>> | Magyarul |
On isomorphic representation of nondeterministic tree automata
B. Imreh
Abstract:
In this paper we deal with isomorphically complete systems of finite nondeterministic tree automata with respect to the general product and the cube-product. In both cases characterizations of isomorphically complete systems are presented which imply that the general product and the cube-product are equivalent regarding isomorphic completeness.
Gyenizse Pal 1996. Szeptember 3. Kedd 13:17:56 MET DST