Hierarchies of String Languages Generated by Deterministic Tree Transducers

Authors:
Joost Engelfriet;Sebastian Maneth
Affiliations:
-;-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 4
Cited 1

Decidability of the finiteness of ranges of tree transductions

Information and Computation
Syntax-Directed Semantics: Formal Models Based on Tree Transducers

Syntax-Directed Semantics: Formal Models Based on Tree Transducers
String Languages Generated by Total Deterministic Macro Tree Transducers

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Formal Languages: Origins and Directions

IEEE Annals of the History of Computing

Output string languages of compositions of deterministic macro tree transducers

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The composition of total deterministic macro tree transducers gives rise to a proper hierarchy with respect to the generated string languages (these are the languages obtained by taking the yields of the output trees). The same holds for attributed tree transducers, for controlled EDT0L systems, and for YIELD mappings (which shows properness of the IO-hierarchy).