Abstract
The class of string languages obtained by taking the yields of output tree languages of total deterministic macro tree transducers (MTTs) is investigated. The first main result is that MTTs which are linear and nondeleting in the parameters generate the same class of string languages as total deterministic top-down tree transducers. The second main result is a so called “bridge theorem”; it can be used to show that there is a string language generated by a nondeterministic top-down tree transducer with monadic input, i.e., an ET0L language, which cannot be generated by an MTT. In fact, it is shown that this language cannot even be generated by the composition closure of MTTs; hence it is also not in the IO-hierarchy.
This work was supported by the EC TMR Network GETGRATS.
Chapter PDF
Similar content being viewed by others
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.
References
R. Bloem and J. Engelfriet. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Technical Report 98-02, Leiden University, 1998.
B. Courcelle and P. Franchi-Zannettacci. Attribute grammars and recursive program schemes. Theoret. Comput. Sci., 17:163–191 and 235-257, 1982.
Frank Drewes and Joost Engelfriet. Decidability of finiteness of ranges of tree transductions. Inform. and Comput., 145:1–50, 1998.
J. Engelfriet and S. Maneth. Macro tree transducers, attribute grammars, and MSO definable tree translations. Technical Report 98-09, Leiden University, 1998.
J. Engelfriet. Surface tree languages and parallel derivation trees. Theoret. Comput. Sci., 2:9–27, 1976.
J. Engelfriet. Some open questions and recent results on tree transducers and tree languages. In R. V. Book, editor, Formal language theory; perspectives and open problems. New York, Academic Press, 1980.
J. Engelfriet. The complexity of languages generated by attribute grammars. SIAM J. Comput., 15(1):70–86, 1986.
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 H. Vogler. Macro tree transducers. J. of Comp. Syst. Sci., 31:71–146, 1985.
M. J. Fischer. Grammars with macro-like productions. PhD thesis, Harvard University, Massachusetts, 1968.
Z. Fülöp and S. Maneth. A characterization of ET0L tree languages by cooperating regular tree grammars. (To appear in “Grammatical Models of Multi-Agent Systems”, Gordon and Breach, London), 1998.
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.
[GS97] F. Gécseg and M. Steinby. Tree automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3, chapter 1. Springer-Verlag, 1997.
A. Kühnemann. A pumping lemma for output languages of macro tree transducers. Technical Report TUD/FI95/08, Technical University Dresden, 1998. (also in Proc. CAAP’96, LNCS 1059, pages 44–58. Springer-Verlag, 1997.).
S. Maneth. Cooperating distributed hyperedge replacement grammars. In A. Kelemenová, editor, Proc. MFCS’98 Satellite Workshop on Grammar Systems, pages 149–164. Silesian University, 1998. (To appear in Grammars).
S. Maneth. The generating power of total deterministic tree transducers. Inform. and Comput., 147:111–144, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maneth, S. (1999). String Languages Generated by Total Deterministic Macro Tree Transducers. In: Thomas, W. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 1999. Lecture Notes in Computer Science, vol 1578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49019-1_18
Download citation
DOI: https://doi.org/10.1007/3-540-49019-1_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65719-4
Online ISBN: 978-3-540-49019-7
eBook Packages: Springer Book Archive