The Generating Power of Total Deterministic Tree Transducers

  title={The Generating Power of Total Deterministic Tree Transducers},
  author={Sebastian Maneth},
  journal={Inf. Comput.},
  • S. Maneth
  • Published 15 December 1998
  • Computer Science
  • Inf. Comput.
Abstract 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 abstraction; i.e., we show that attributed tree transducers and attribute grammars generate the same… 

Figures from this paper

Attribute grammars as tree transducers and their descriptional composition
This work presents an alternative first-order functional interpretation of attribute grammars where the input tree is replaced by an extended cyclic tree each node of which is aware of its context viewed as an additional child tree.
Tree Languages Generated be Context-Free Graph Grammars
A characterization is given of the class of tree languages which can be generated by context-free hyperedge replacement (HR) graph grammars, in terms of macro tree transducers (MTTs). This
String Languages Generated by Total Deterministic Macro Tree Transducers
The class of string languages obtained by taking the yields of output tree languages of total deterministic macro tree transducers (MTTs) is investigated and a so called "bridge theorem" is used to show that there is a string language generated by a nondeterministic top-down tree transducer with monadic input.
Output String Languages of Compositions of Deterministic Macro Tree Transducers
Results hold for attributed tree transducers, for controlled EDT0L systems, and for YIELD mappings (which proves properness of the IO-hierarchy).
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations
A characterization is given of the class of tree translations definable in monadic second-order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO definable tree
Structured Document Transformations Based on XSL
It is shown that the emptiness and finiteness problems are decidable for ranges of DTLdmso programs and that the ranges are closed under intersection with generalized Document Type Definitions (DTDs).
Cooperating Distributed Hyperedge Replacement Grammars
The concept of cooperation and distribution as known from the area of grammar systems is introduced to graph grammars; more precisely, to hyperedge replacement (for short, HR) grammars. This can be


On the Generating Power of Deterministic Tree Transducers
This paper shows that attributed tree transducers and attribute grammars generate the same class of term (or tree) languages and proves a hierarchy of tree languages generated by context{free hypergraph Grammars w.r.t. generating power.
Passes and Paths of Attributive Grammars
A Pumping Lemma for Output Languages of Attributed Tree Transducers
There is no noncircular, producing, and visiting attributed tree transducer which computes the set of all monadic trees with exponential height as output and there is a hierarchy of non Circular, Producing, and visited attributed Tree transducers with respect to their number of attributes.
A Two-Dimensional Hierarchy for Attributed Tree Transducers
This paper proves a two-dimensional hierarchy for classes of producing attributed tree transducers, where the two dimensions refer to the maximum number of synthesized and inherited attributes, respectively.
On attributed tree transducers
In this chapter we introduce the third formal model of syntax-directed semantics: the attributed tree transducer. It is created by abstraction from attribute grammars. It can also handle context
Context-Free Graph Grammars
Graph languages are sets of labeled graphs that can be generated by graph grammars, and in particular by context-free graph gramMars, which can be used to generate string languages and tree languages.
Attribute Grammars and Recursive Program Schemes II