On domain and range tree languages of superlinear deterministic top-down tree transformations
Denote by sl-DT the class of superlinear deterministic top-down tree transformations, by REC the class of recognizable tree languages, and by DREC the class of deterministic recognizable tree languages. In this paper we present the following results. The class dom (sl-DT ) is exactly the class of tr...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1996
|
| Sorozat: | Acta cybernetica
12 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12560 |
| LEADER | 01363nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12560 | ||
| 005 | 20220613142320.0 | ||
| 008 | 161015s1996 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 Dányi Gábor | |
| 245 | 1 | 3 | |a On domain and range tree languages of superlinear deterministic top-down tree transformations |h [elektronikus dokumentum] / |c Dányi Gábor |
| 260 | |c 1996 | ||
| 300 | |a 261-277 | ||
| 490 | 0 | |a Acta cybernetica |v 12 No. 3 | |
| 520 | 3 | |a Denote by sl-DT the class of superlinear deterministic top-down tree transformations, by REC the class of recognizable tree languages, and by DREC the class of deterministic recognizable tree languages. In this paper we present the following results. The class dom (sl-DT ) is exactly the class of tree languages recognized by semi-universal deterministic top-down tree recognizers, which are introduced in this paper. Moreover, for any L € DREC, it is decidable whether L £ don i(sl-DT ) holds and we also present a decision procedure. Finally, we show that ra,nge(sl-DT) = REC. | |
| 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 | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12560/1/cybernetica_012_numb_003_261-277.pdf |z Dokumentum-elérés |