A pumping lemma for output languages of attributed tree transducers

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

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Kühnemann Armin
Vogler Heiko
Dokumentumtípus: Cikk
Megjelent: 1994
Sorozat:Acta cybernetica 11 No. 4
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12534
LEADER 01380nab a2200229 i 4500
001 acta12534
005 20220613114451.0
008 161015s1994 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 Kühnemann Armin 
245 1 2 |a A pumping lemma for output languages of attributed tree transducers  |h [elektronikus dokumentum] /  |c  Kühnemann Armin 
260 |c 1994 
300 |a 261-305 
490 0 |a Acta cybernetica  |v 11 No. 4 
520 3 |a 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. 
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 
700 0 1 |a Vogler Heiko  |e aut 
856 4 0 |u http://acta.bibl.u-szeged.hu/12534/1/cybernetica_011_numb_004_261-305.pdf  |z Dokumentum-elérés