Context-free graph grammars and concatenation of graphs

Acta Informatica

Volumn 34, Issue 10, 1997, Pages 773-803

  Engelfriet, Joost ^a   Vereijken, Jan Joris ^a,b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONTEXT FREE LANGUAGES; GRAPH THEORY;

CONCATENATION; GRAPH LANGUAGE;

CONTEXT FREE GRAMMARS;

EID: 0039375896     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050106     Document Type: Article

References (33)

1. M. Bauderon, B. Courcelle: Graph expressions and graph rewritings, Math. Syst. Theory 20 (1987), 83-127
2. D.B. Benson: The basic algebraic structures in categories of derivations, Inform, and Control 28 (1975), 1-29
3. J. Berstel: Transductions and Context-Free Languages, Teubner, Stuttgart, 1979
4. H.L. Bodlaender: A partial k-arboretum of graphs with bounded treewidth, Tech. Report UU-CS-1996-02, Utrecht University, January 1996
5. Bossut, M. Dauchet, B. Warin: A Kleene theorem for a class of planar acyclic graphs, Inform. and Comput. 117 (1995), 251-265
6. V. Claus: Ein Vollständigkeitssatz für Programme und Schaltkreise, Acta Informatica 1 (1971), 64-78
7. B. Courcelle: An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theor. Comput. Sci. 55 (1987), 141-181
8. B. Courcelle: Graph rewriting: an algebraic and logic approach, in Handbook of Theoretical Computer Science, Vol.B (J. van Leeuwen, ed.), Elsevier, 1990, pp. 193-242
9. B. Courcelle: The monadic second-order logic of graphs III: Tree-decompositions, minors and complexity issues, RAIRO Theoretical Informatics and Applications 26 (1992), 257-286
10. B. Courcelle, J. Engelfriet, G. Rozenberg: Handle-rewriting hypergraph languages, J. of Comp. Syst. Sci. 46 (1993), 218-270
11. F. Drewes: Computation by tree transductions, Ph. D. Thesis, University of Bremen, February 1996
12. Ehrig, K.-D. Kiermeier, H.-J. Kreowski, W. Kühnel: Universal Theory of Automata, Teubner, Stuttgart, 1974
13. J.A. Ellis, I.H. Sudborough, J.S. Turner: The vertex separation and search number of a graph, Inform. and Comput. 113 (1994), 50-79
14. J. Engelfriet: Graph grammars and tree transducers, Proc. CAAP'94 (S.Tison, ed.), Lecture Notes in Computer Science 787, Springer-Verlag, Berlin, 1994, pp. 15-36
15. Engelfriet, L.M. Heyker: The string generating power of context-free hypergraph grammars, J. of Comp. Syst. Sci. 43 (1991), 328-360
16. Engelfriet, G. Rozenberg, G. Slutzki: Tree transducers, L systems, and two-way machines, J. of Comp. Syst. Sci. 20 (1980), 150-202
17. Engelfriet, J.J. Vereijken: Concatenation of graphs, in Graph Grammars and their Application to Computer Science (J. Cuny, H. Ehrig, G. Engels, G. Rozenberg, eds.), Lecture Notes in Computer Science 1073, Springer-Verlag, Berlin, 1996, pp.368-382
18. F. Gécseg, M. Steinby: Tree Automata, Akadémiai Kiadó, Budapest, 1984
19. S. Greibach: One-way finite visit automata, Theor. Comput. Sci. 6 (1978), 175-221
20. Habel: Hyperedge Replacement: Grammars and Languages, Lecture Notes in Computer Science 643, Springer-Verlag, Berlin, 1992
21. A. Habel, H.-J. Kreowski: May we introduce to you: hyperedge replacement, in Graph-Grammars and their Application to Computer Science (H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld, eds.), Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987, pp. 15-26
22. A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for decision problems on hyperedge replacement graph languages, Acta Informatica 26 (1989), 657-677
23. J.E. Hopcroft, J.D. Ullman: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979
24. G. Hotz: Eine Algebraisierung des Syntheseproblems von Schaltkreisen, EIK 1 (1965), 185-205, 209-231
25. G. Hotz: Eindeutigkeit und Mehrdeutigkeit formaler Sprachen, EIK 2 (1966), 235-246
26. G. Hotz, R. Kolla, P. Molitor: On network algebras and recursive equations, in Graph-Grammars and Their Application to Computer Science (H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld, eds.), Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987, pp.250-261
27. T. Kloks: Treewidth, Lecture Notes in Computer Science 842, Springer-Verlag, Berlin, 1994
28. C. Lautemann: Decomposition trees: structured graph representation and efficient algorithms, Proc. CAAP'88, Lecture Notes in Computer Science 299, Springer-Verlag, Berlin, 1988, pp.28-39
29. J. Mezei, J.B. Wright: Algebraic automata and context-free sets, Inform, and Control 11 (1967), 3-29
30. V. Rajlich: Absolutely parallel grammars and two-way finite state transducers, J. of Comp. Syst. Sci. 6 (1972), 324-342
31. N. Robertson, P.D. Seymour: Graph minors I. Excluding a forest, J. Comb. Theory Ser.B 35 (1983), 39-61
32. A. Salomaa: Formal Languages, Academic Press, New York, 1973
33. J.J. Vereijken: Graph Grammars and Operations on Graphs, Master's Thesis, Leiden University, May 1993