On isomorphic representation of nondeterministic tree automata
In this paper we deal with isomorphically complete systems of finite nondeterministic tree automata with respect to the general product and the cubeproduct. In both cases characterizations of isomorphically complete systems are presented which imply that the general product and the cube-product are...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1995
|
| Sorozat: | Acta cybernetica
12 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12540 |
| Tartalmi kivonat: | In this paper we deal with isomorphically complete systems of finite nondeterministic tree automata with respect to the general product and the cubeproduct. 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 11-21 |
| ISSN: | 0324-721X |