Tree languages generated by context-free graph grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1764, Issue , 2000, Pages 15-29

  Engelfriet, Joost ^a   Maneth, Sebastian ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; CONTEXT SENSITIVE GRAMMARS; FORESTRY; GRAPH THEORY;

CONTEXT-FREE; CONTEXT-FREE GRAPH GRAMMARS; GRAPH GRAMMAR; HYPEREDGE REPLACEMENT; NORMAL FORM; TREE LANGUAGES; TREE TRANSDUCERS;

CONTEXT FREE LANGUAGES;

EID: 84949952583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46464-8_2     Document Type: Conference Paper

References (29)

1. A. Arnold and M. Dauchet. Un théorème de duplication pour les forêts algébriques. J. of Comp. Syst. Sci., 13:223–244, 1976.
2. A. V. Aho and J. D. Ullman. Translations on a context-free grammar. Inform. and Control, 19:439–475, 1971.
3. M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Math. Systems Theory, 20:83–127, 1987.
4. 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. To appear in J. of Comp. Syst. Sci. CE 95.
5. B. Courcelle and J. Engelfriet. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Math. Systems Theory, 28:515–552, 1995.
6. B. Courcelle and P. Franchi-Zannettacci. Attribute grammars and recursive program schemes. Theoret. Comput. Sci., 17:163–191 and 235–257, 1982.
7. B. Courcelle. The monadic second-order logic of graphs. I. recognizable sets of infinite graphs. Information and Computation, 85:12–75, 1990.
8. B. Courcelle. Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci., 126:53–75, 1994.
9. F. Drewes, H.-J. Kreowski, and A. Habel. Hyperedge replacement graph grammars. In G. Rozenberg, editor, Handbook of Graph Grammars and computing by graph transformation, Volume 1, chapter 2, pages 95–162. World Scientific, Singapore, 1997.
10. J. Duske, R. Parchmann, M. Sedello, and J. Specht. IO-macrolanguages and attributed translations. Inform. and Control, 35:87–105, 1977.
11. F. Drewes. Computation by Tree Transductions. PhD thesis, University of Bremen, 1996.
12. F. Drewes. A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars. Theory Comput. Systems, 32:159–208, 1999.
13. J. Engelfriet and G. Filè. The formal power of one-visit attribute grammars. Acta Informatica, 16:275–302, 1981.
14. J. Engelfriet and L. Heyker. Context-free hypergraph grammars have the same term-generating power as attribute grammars. Acta Informatica, 29:161–210, 1992.
15. J. Engelfriet and S. Maneth. Macro tree transducers, attribute grammars, and MSO definable tree translations. Technical Report 98-09, Leiden University, 1998. To appear in Inform. and Comput.
16. J. Engelfriet. Graph grammars and tree transducers. In S. Tison, editor, Proceedings of the 19th Colloquium on Trees in Algebra and Programming–CAAP 94, volume 787 of LNCS, pages 15–36. Springer-Verlag, 1994.
17. J. Engelfriet. Context-free graph grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3, chapter 3. Springer-Verlag, 1997.
18. J. Engelfriet, G. Rozenberg, and G. Slutzki. Tree transducers, L systems, and two-way machines. J. of Comp. Syst. Sci., 20:150–202, 1980.
19. J. Engelfriet and E. M. Schmidt. IO and OI, Part I. J. of Comp. Syst. Sci., 15:328–353, 1977. And Part II, J. of Comp. Syst. Sci., 16: 67–99 (1978).
20. J. Engelfriet and H. Vogler. Macro tree transducers. J. of Comp. Syst. Sci., 31:71–146, 1985.
21. 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.
22. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
23. F. Gécseg and M. Steinby. Tree automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Vol. 3, chapter 1. Springer-Verlag, 1997.
24. A. Habel. Hyperedge Replacement: Grammars and Languages. PhD thesis, University of Bremen, 1989.
25. A. Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of LNCS. Springer-Verlag, 1992.
26. S. Maneth. The generating power of total deterministic tree transducers. Inform. and Comput., 147:111–144, 1998.
27. D. Plump. Term graph rewriting. Technical Report CSI-R9822, Computing Science Institute Nijmegen, 1998. To appear in Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2, World Scientific, Singapore.
28. J.-C. Raoult. Rational tree relations. Bull. Belg. Math. Soc., 4:149–176, 1997. See also “Recursively defined tree transductions”, Proc. RTA’93, LNCS 690, pages 343-357.
29. W. C. Rounds. Mappings and grammars on trees. Math. Systems Theory, 4:257–287, 1970.