Abstract
Generalizing ET0L systems, we introduce branching synchronization grammars with nested tables. Branching synchronization grammars with tables of nesting depth n have the same string- and tree-generating power as n-fold compositions of top-down tree transducers.
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
Brenda S. Baker. Tree transducers and tree languages. Information and Control, 37:241–266, 1978.
Frank Drewes and Joost Engelfriet. Branching Synchronization Grammars with Nested Tables. Technical Report UMINF 02.22, Umeå University, 2002.
Frank Drewes. Tree-based picture generation. Theoretical Computer Science, 246:1–51, 2000.
Frank Drewes. Tree-based generation of languages of fractals. Theoretical Computer Science, 262:377–414, 2001.
Joost Engelfriet. Surface tree languages and parallel derivation trees. Theoretical Computer Science, 2:9–27, 1976.
Joost Engelfriet. Three hierarchies of transducers. Mathematical Systems Theory, 15:95–125, 1982.
Joost Engelfriet, Grzegorz Rozenberg, and Giora Slutzki. Tree transducers, L systems, and two-way machines. Journal of Computer and System Sciences, 20:150–202, 1980.
Zoltán Fülöp and Heiko Vogler. Syntax-Directed Semantics: Formal Models Based on Tree Transducers. Springer, 1998.
Ferenc Gécseg and Magnus Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
Ferenc Gécseg and Magnus Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. III: Beyond Words, chapter 1, pages 1–68. Springer, 1997.
William C. Rounds. Mappings and grammars on trees. Mathematical Systems Theory, 4:257–287, 1970.
Grzegorz Rozenberg. Extension of tabled 0L systems and languages. International Journal of Computer and Information Sciences, 2:311–334, 1973.
Grzegorz Rozenberg and Arto Salomaa, editors. Handbook of Formal Languages, volume 1–3. Springer, 1997.
Sven Skyum. Decomposition theorems for various kinds of languages parallel in nature. SIAM Journal of Computing, 5:284–296, 1976.
James W. Thatcher. Generalized2 sequential machine maps. Journal of Computer and System Sciences, 4:339–367, 1970.
James W. Thatcher. Tree automata: an informal survey. In A.V. Aho, editor, Currents in the Theory of Computing, pages 143–172. Prentice Hall, 1973.
Sándor Vágvölgyi. On compositions of root-to-frontier tree transformations. Acta Cybernetica, 7:443–480, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drewes, F., Engelfriet, J. (2003). Branching Grammars: A Generalization of ET0L Systems. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_21
Download citation
DOI: https://doi.org/10.1007/3-540-45007-6_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40434-7
Online ISBN: 978-3-540-45007-8
eBook Packages: Springer Book Archive