Well-Nested Tree Languages and Attributed Tree Transducers
نویسنده
چکیده
Well-nested word languages have been advertised as adequate formalizations of the notion of mild context-sensitivity. The main result of this paper is a characterization of well-nested tree languages in terms of simple attributed tree transducers.
منابع مشابه
Domains of Partial Attributed Tree Transducers Domains of Partial Attributed Tree Transducers
The domains of partial attributed tree transducers (patt's) are the tree languages recognized by tree walking automata in universal acceptance mode. Moreover, the domains of patt's having monadic output are the tree languages recognized by deter-ministic tree walking automata.
متن کاملOn the Generating Power of Deterministic Tree Transducers
Attributed tree transducers are abstract models to study properties of attribute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context{free grammar. In this paper we show that with respect to the generating power this is not an abstraction,...
متن کاملA Two-Dimensional Hierarchy for Attributed Tree Transducers
Attributed tree transducers are formal models for studying properties of attribute grammars. In this paper we prove a two{dimen-sional hierarchy for classes of producing attributed tree transducers. The two dimensions refer to the maximum number of synthesized and inherited attributes, respectively. To this end we apply a pumping lemma for output languages of producing attributed tree transducers.
متن کاملDomains of partial attributed tree transducers
The domains of partial attributed tree transducers (patt’s) are the tree languages recognized by tree walking automata in universal acceptance mode. Moreover, the domains of patt’s having monadic output are the tree languages recognized by deterministic tree walking automata. 2000 Elsevier Science B.V. All rights reserved.
متن کاملThe Generating Power of Total Deterministic Tree Transducers
Attributed tree transducers are abstract models used to study properties of attribute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context-free grammar. In this paper we show that with respect to the generating power this is not an abstrac...
متن کامل