| Research>>> Acta Cybernetica>>> Previous Volumes>>> | Magyarul |
No Title
A Pumping Lemma
for Output Languages
of Attributed Tree Transducers
A. Kühnemann
H. Vogler
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.
Gyenizse Pal 1996. Szeptember 4. Szerda 12:51:04 MET DST