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 |
| LEADER | 01089nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12577 | ||
| 005 | 20220613151538.0 | ||
| 008 | 161015s1997 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Imreh Balázs | |
| 245 | 1 | 3 | |a On αi-products of nondeterministic tree automata |h [elektronikus dokumentum] / |c Imreh Balázs |
| 260 | |c 1997 | ||
| 300 | |a 41-54 | ||
| 490 | 0 | |a Acta cybernetica |v 13 No. 1 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika, Automaták | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12577/1/cybernetica_013_numb_001_041-054.pdf |z Dokumentum-elérés |