A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars

Theory of Computing Systems

Volumn 32, Issue 2, 1999, Pages 159-208

  Drewes, F ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; FORESTRY; FORMAL LANGUAGES; GRAPH THEORY; TRANSDUCERS; TREES (MATHEMATICS);

GRAPH GRAMMAR; HYPEREDGE REPLACEMENT; HYPEREDGES; HYPERTREES; RIGHT-HAND SIDES; STRING GRAPHS; TOP-DOWN TREE TRANSDUCERS; TREE TRANSDUCERS;

CHARACTERIZATION;

EID: 0033479947     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000115     Document Type: Article

References (27)

1. Alfred V. Aho and Jeffrey D. Ullman. Translations on a context free grammar. Information and Control, 19:439-475, 1971.
2. Michel Bauderon and Bruno Courcelle. Graph expressions and graph rewriting. Mathematical Systems Theory, 20:83-127, 1987.
3. Bruno Courcelle. The monadic second-order logic of graphs, V: on closing the gap between definability and recognizability. Theoretical Computer Science, 80:153-202, 1991.
4. Bruno Courcelle and Joost Engelfriet. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Mathematical Systems Theory, 28:515-552, 1995.
5. Frank Drewes. Computation by tree transductions. Doctoral dissertation, University of Bremen, 1996.
6. Frank Drewes. On the generation of trees by hyperedge replacement. In I. Prívara and P. Ružička, editors, Proc. Mathematical Foundations of Computer Science 1997, volume 1295 of Lecture Notes in Computer Science, pages 229-238. Springer-Verlag, Berlin, 1997.
7. Frank Drewes and Joost Engelfriet. Decidability of the finiteness of ranges of tree transductions. Information and Computation, 145:1-50, 1998.
8. Frank Drewes, Annegret Habel, and Hans-Jörg Kreowski. Hyperedge replacement graph grammars. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformations, volume I, chapter 2, pages 95-162. World Scientific, Singapore, 1997.
9. Joost Engelfriet. Bottom-up and top-down tree transformations - a comparison. Mathematical Systems Theory, 9(3):198-231, 1975.
10. Joost Engelfriet. Top-down tree transducers with regular look-ahead. Mathematical Systems Theory, 10:289-303, 1977.
11. Joost Engelfriet. On tree transducers for partial functions. Information Processing Letters, 7:170-172, 1978.
12. Joost Engelfriet. Graph grammars and tree transducers. In S. Tison, editor, Proc. CAAP 94, volume 787 of Lecture Notes in Computer Science, pages 15-37. Springer-Verlag, Berlin, 1994.
13. Joost Engelfriet. Context-free graph grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume III, chapter 3, pages 125-213. Springer-Verlag, Berlin, 1997.
14. Joost Engelfriet and Linda Heyker. The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences, 43:328-360, 1991.
15. Joost Engelfriet and Linda Heyker. Context-free hypergraph grammars have the same term-generating power as attribute grammars. Acta Informatica, 29:161-210, 1992.
16. Joost Engelfriet, Linda Heyker, and George Leih. Context-free graph languages of bounded degree are generated by apex graph grammars. Acta Informatica, 31:341-378, 1994.
17. 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.
18. Joost Engelfriet and Heiko Vogler. The translation power of top-down tree-to-graph transducers. Journal of Computer and System Sciences, 49:258-305, 1994.
19. Joost Engelfriet and Heiko Vogler. The equivalence of bottom-up and top-down tree-to-graph transducers. Journal of Computer and System Sciences, 56:332-356, 1998.
20. Jerome Feder. Plex languages. Information Science, 3:225-241, 1971.
21. Zoltán Fülöp and Sándor Vágvölgyi. Variants of top-down tree transducers with look-ahead. Mathematical Systems Theory, 21:125-145, 1989.
22. Ferenc Gécseg and Magnus Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
23. Ferenc Gécseg and Magnus Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages, volume III, chapter 1, pages 1-68. Springer-Verlag, Berlin, 1997.
24. Pál Gyenizse and Sándor Vágvölgyi. Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations. Theoretical Computer Science, 156:71-97, 1996.
25. Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992.
26. Annegret Habel and Hans-Jörg Kreowski. Characteristics of graph languages generated by edge replacement. Theoretical Computer Science, 51:81-115, 1987.
27. Saunders MacLane. A structural characterization of planar combinatorial graphs. Duke Mathematical Journal, 3:460-472, 1937.