• DOI:10.1006/inco.1998.2736
• Corpus ID: 5995532

The Generating Power of Total Deterministic Tree Transducers

@article{Maneth1998TheGP,
  title={The Generating Power of Total Deterministic Tree Transducers},
  author={Sebastian Maneth},
  journal={Inf. Comput.},
  year={1998},
  volume={147},
  pages={111-144}
}

• 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 class of term (or tree) languages. To prove this, a number of results concerning the generating power of top-down tree transducers are established, which are interesting in their own. We also show that the classes of output languages of attributed tree transducers form a hierarchy with respect to the number of attributes. The latter result is achieved by proving a hierarchy of classes of tree languages generated by context-free hypergraph grammars with respect to their rank.