Hierarchies of String Languages Generated by Deterministic Tree Transducers
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).
KeywordsYield Mapping Hasse Diagram Tree Automaton Tree Language Rank Zero
Unable to display preview. Download preview PDF.
- [FV98]Z. Fülöp and H. Vogler. Syntax-Directed Semantics-Formal Models based on Tree Transducers. EATCS Monographs on Theoretical Computer Science (W. Brauer, G. Rozenberg, A. Salomaa, eds.). Springer-Verlag, 1998.Google Scholar
- [Man99]S. Maneth. String languages generated by total deterministic macro tree transducers. In W. Thomas, editor, Proc. FOSSACS’99, volume 1578 of LNCS, pages 258–272. Springer-Verlag, 1999.Google Scholar