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 |
| LEADER | 01105nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12540 | ||
| 005 | 20220613131237.0 | ||
| 008 | 161015s1995 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 isomorphic representation of nondeterministic tree automata |h [elektronikus dokumentum] / |c Imreh Balázs |
| 260 | |c 1995 | ||
| 300 | |a 11-21 | ||
| 490 | 0 | |a Acta cybernetica |v 12 No. 1 | |
| 520 | 3 | |a 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. | |
| 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/12540/1/cybernetica_012_numb_001_011-021.pdf |z Dokumentum-elérés |