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).
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L. Boasson, B. Courcelle, and M. Nivat. The rational index: a complexity measure for languages. SIAM Journal on Computing, 10(2):284–296, 1981.
W. Damm. The IO-and OI-hierarchies. Theoret. Comput. Sci., 20:95–207, 1982.
F. Drewes and J. Engelfriet. Decidability of finiteness of ranges of tree transductions. Inform. and Comput., 145:1–50, 1998.
J. Engelfriet. Three hierarchies of transducers. Math. Systems Theory, 15:95–125, 1982.
J. Engelfriet, G. Rozenberg, and G. Slutzki. Tree transducers, L systems, and two-way machines. J. of Comp. Syst. Sci., 20:150–202, 1980.
J. Engelfriet and E.M. Schmidt. IO and OI, Part II. J. of Comp. Syst. Sci., 16:67–99, 1978.
J. Engelfriet and H. Vogler. Macro tree transducers. J. of Comp. Syst. Sci., 31:71–146, 1985.
Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5:261–279, 1981.
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.
S.A. Greibach. Formal languages: origins and directions. Ann. of the Hist. of Comput., 3(1):14–41, 1981.
F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
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.
W.C. Rounds. Mappings and grammars on trees. Math. Systems Theory, 4:257–287, 1970.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J., Maneth, S. (2002). Hierarchies of String Languages Generated by Deterministic Tree Transducers. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_19
Download citation
DOI: https://doi.org/10.1007/3-540-46011-X_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43453-5
Online ISBN: 978-3-540-46011-4
eBook Packages: Springer Book Archive