On αi-products of nondeterministic tree automata
In this paper, we characterize the isomorphically complete systems of nondeterministic tree automata with respect to the family of «¡-products. In particular, our characterization yields that any finite nondeterministic tree automata can be embedded isomorphically into a suitable serial product of t...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1997
|
| Sorozat: | Acta cybernetica
13 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12577 |
| Tartalmi kivonat: | In this paper, we characterize the isomorphically complete systems of nondeterministic tree automata with respect to the family of «¡-products. In particular, our characterization yields that any finite nondeterministic tree automata can be embedded isomorphically into a suitable serial product of two-state nondeterministic tree automata. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 41-54 |
| ISSN: | 0324-721X |