A pumping lemma for output languages of attributed tree transducers

Kühnemann Armin and Vogler Heiko: A pumping lemma for output languages of attributed tree transducers. In: Acta cybernetica, (11) 4. pp. 261-305. (1994)

[thumbnail of cybernetica_011_numb_004_261-305.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_011_numb_004_261-305.pdf

Download (1MB) | Preview

Abstract

An attributed tree transducer is a formal model for studying properties of attribute grammars. In this paper we introduce and prove a pumping lemma for output languages of noncircular, producing, and visiting attributed tree transducers. We apply this pumping lemma to gain two results: (1) there is no noncircular, producing, and visiting attributed tree transducer which computes the set of all monadic trees with exponential height as output and (2) there is a hierarchy of noncircular, producing, and visiting attributed tree transducers with respect to their number of attributes.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1994
Volume: 11
Number: 4
ISSN: 0324-721X
Page Range: pp. 261-305
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38498/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 303-305. ; ö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. 11:44
URI: http://acta.bibl.u-szeged.hu/id/eprint/12534

Actions (login required)

View Item View Item