On domain and range tree languages of superlinear deterministic top-down tree transformations

Dányi Gábor: On domain and range tree languages of superlinear deterministic top-down tree transformations. In: Acta cybernetica, (12) 3. pp. 261-277. (1996)

[thumbnail of cybernetica_012_numb_003_261-277.pdf]
Cikk, tanulmány, mű

Download (914kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1996
Volume: 12
Number: 3
ISSN: 0324-721X
Page Range: pp. 261-277
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38501/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 276-277. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 13. 14:23
URI: http://acta.bibl.u-szeged.hu/id/eprint/12560

Actions (login required)

View Item View Item