Regular description of context-free graph languages

Journal of Computer and System Sciences

Volumn 53, Issue 3, 1996, Pages 556-574

  Engelfriet, Joost ^a   Van Oostrom, Vincent ^a,b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL PATH ANALYSIS; DIFFERENTIAL EQUATIONS; TREES (MATHEMATICS);

GRAPH LANGUAGES; STRING LANGUAGES;

QUERY LANGUAGES;

EID: 0030400540     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0087     Document Type: Article

References (45)

1. M. Bauderon and B. Courcelle, Graph expressions and graph rewritings, Math. Systems Theory 20 (1987), 83-127.
2. F. J. Brandenburg, On partially ordered graph grammars, in [ENRR, pp. 99-111].
3. F. J. Brandenburg, On polynomial time graph grammars, in "Proceedings STACS 88," Lecture Notes in Computer Science, Vol. 294, pp. 227-236, Springer-Verlag, Berlin, 1988.
4. F. J. Brandenburg, The equivalence of boundary and confluent graph grammars on graph languages of bounded degree, in "Rewriting Techniques and Applications" (R. V. Book, Ed.), Lecture Notes in Computer Science, Vol. 488, pp. 312-322, Springer-Verlag, Berlin, 1991.
5. J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg (Eds.), "Graph Grammars and Their Application to Computer Science," Lecture Notes in Computer Science, Vol. 1073, Springer-Verlag, Berlin, 1996.
6. B. Courcelle, J. Engelfriet, and G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci. 46 (1993), 218-270.
7. D. G. Corneil, H. Lerchs, and L. Stewart Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981), 163-174.
8. B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theor. Comput. Sci. 55 (1987), 141-181.
9. B. Courcelle, The monadic second-order logic of graphs VII: Graphs as relational structures, Theor. Comput. Sci. 101 (1992), 3-33.
10. B. Courcelle, Structural properties of context-free sets of graphs generated by vertex replacement, Inform. and Comput. 116 (1995), 275-293.
11. J. Engelfriet and L. M. Heyker, The string generating power of context-free hypergraph grammars, J. Comput. System Sci. 43 (1991), 328-360.
12. J. Engelfriet and L. M. Heyker, Hypergraph languages of bounded degree, J. Comput. System Sci. 48 (1994), 58-89.
13. J. Engelfriet, L. M. Heyker, and G. Leih, Context-free graph languages of bounded degree are generated by apex graph grammars, Acta Inform. 31 (1994), 341-378.
14. H. Ehrig, D. Janssens, H.-J. Kreowski, and G. Rozenberg, "Concurrency of Node-Label Controlled Graph Transformations," Report 82-38, University of Antwerp, U. I. A., 1982.
15. H. Ehrig, H.-J. Kreowski, and G. Rozenberg, (Eds.), "Graph-Grammars and Their Application to Computer Science," Lecture Notes in Computer Science, Vol. 532, Springer-Verlag, Berlin, 1991.
16. J. Engelfriet and G. Leih, Linear graph grammars: Power and complexity, Inform. and Comput. 81 (1989), 88-121.
17. J. Engelfriet and G. Leih, Complexity of boundary graph languages, RAIRO Theor. Inform. Appl. 24 (1990), 267-274.
18. J. Engelfriet, G. Leih, and G. Rozenberg, Apex graph grammars, in [ENRR, pp. 167-185].
19. J. Engelfriet, G. Leih, and G. Rozenberg, Nonterminal separation in graph grammars, Theor. Comput. Sci. 82 (1991), 95-111.
20. J. Engelfriet, G. Leih, and E. Welzl, Boundary graph grammars with dynamic edge relabelling, J. Comput. System Sci. 40 (1990), 307-345.
21. J. Engelfriet, Context-free NCE graph grammars, in "Proceedings FCT'89," Lecture Notes in Computer Science, Vol. 380, pp. 148-161, Springer-Verlag, Berlin, 1989.
22. J. Engelfriet, A characterization of context-free NCE graph languages by monadic second-order logic on trees, in [EKR, pp. 311-327].
23. J. Engelfriet, A Greibach normal form for context-free graph grammars, in "Proceedings ICALP'92" (W. Kuich, Ed.), Lecture Notes in Computer Science, Vol. 623, pp. 138-149, Springer-Verlag, Berlin, 1992.
24. J. Engelfriet, Graph grammars and tree transducers, in "Proceedings, CAAP'94" (S. Tison, Ed.), Lecture Notes in Computer Science, Vol. 787, pp. 15-36, Springer-Verlag, Berlin, 1994.
25. H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld (Eds.), "Graph-Grammars and Their Application to Computer Science," Lecture Notes in Computer Science, Vol. 291, Springer-Verlag, Berlin, 1987.
26. J. Engelfriet and G. Rozenberg, A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. and Comput. 84 (1990), 163-206.
27. J. Engelfriet and G. Rozenberg, Node replacement graph grammars, in "Handbook of Graph Transformations," Vol. I. Foundations (G. Rozenberg, Ed.), World Scientific, Singapore, to appear.
28. J. Engelfriet, G. Rozenberg, and G. Slutzki, Tree transducers, L systems, and two-way machines, J. Comput. System Sci. 20 (1980), 150-202.
29. S. A. Greibach, Checking automata and one-way stack languages, J. Comput. System Sci. 3 (1969), 196-217.
30. S. A. Greibach, One way finite visit automata, Theor. Comput. Sci. 6 (1978), 175-221.
31. F. Gécseg and M. Steinby, "Tree Automata," Akad. Kiadó, Budapest, 1984.
32. A. Habel, "Hyperedge Replacement: Grammars and Languages," Lecture Notes in Comput. Sci., Vol. 643, Springer-Verlag, New York/Berlin, 1992.
33. A. Habel and H.-J. Kreowski, May we introduce to you: Hyperedge replacement, in [ENRR, pp. 15-26].
34. J. E. Hopcroft and J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA, 1979.
35. M. Kaul, "Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken," Dissertation, Universität Osnabrück, 1985.
36. C. Kim and D. H. Lee, Separating k-separated eNCE graph languages, Theor. Comput. Sci. 120 (1993), 247-259.
37. M. Nagl, Formal languages of labelled graphs, Computing 16 (1976), 113-137.
38. M. Nagl, A tutorial and bibliographical survey of graph grammars, in "Graph Grammars" (V. Claus, H. Ehrig, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 73, pp. 70-126, Springer-Verlag, Berlin, 1980.
39. M. Nagl, "Graph-Grammatiken" Vieweg, Braunschweig, 1979.
40. V. van Oostrom, "Graph Grammars and 2nd Order Logic," M.Sc. Thesis, Leiden University, January 1989. [Dutch]
41. G. Rozenberg and E. Welzl, Boundary NLC graph grammars - basic definitions, normal forms, and complexity, Inform. and Control 69 (1986), 136-167.
42. R. Schuster, "Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität," Technical report MIP-8711, Universität Passau, 1987.
43. K. Skodinis and E. Wanke, Emptiness problems of eNCE graph languages, J. Comput. System Sci. 51 (1995), 472-485.
44. K. Skodinis and E. Wanke, The bounded degree problem for non-obstructing eNCE graph grammars, in [CEER, pp. 211-224].
45. E. Welzl, Boundary NLC and partition controlled graph grammars, in [ENRR, pp. 593-609].