The OI-hierarchy is closed under control
Information and Computation
High level tree transducers and iterated pushdown tree transducers
Acta Informatica
Iterated stack automata and complexity classes
Information and Computation
The translation power of top-down tree-to-graph transducers
Journal of Computer and System Sciences
Decidability of the finiteness of ranges of tree transductions
Information and Computation
The generating power of total deterministic tree transducer
Information and Computation
Macro tree transducers, attribute grammars, and MSO definable tree translations
Information and Computation
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Hierarchies of String Languages Generated by Deterministic Tree Transducers
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The Complexity of Compositions of Deterministic Tree Transducers
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
The composition of total deterministic macro tree transducers gives rise to a proper hierarchy with respect to their output string languages (these are the languages obtained by taking the yields of the output trees). There is a language not in this hierarchy which can be generated by a (quite restricted) nondeterministic string transducer, namely, a two-way generalized sequential machine. Similar results hold for attributed tree transducers, for controlled EDTOL systems, and for YIELD mappings (which proves properness of the IO-hierarchy). Witnesses for the properness of the macro tree transducer hierarchy can already be found in the latter three hierarchies.