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...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Dányi Gábor
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
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:261-277
ISSN:0324-721X