Logical Description of Context-free Graph Languages

Journal of Computer and System Sciences

Volumn 55, Issue 3, 1997, Pages 489-503

  Engelfriet, Joost ^a   Van Oostrom, Vincent ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; FORMAL LOGIC; GRAPH THEORY;

CONTEXT FREE GRAPH GRAMMARS; CONTEXT FREE GRAPH LANGUAGES; SECOND ORDER LOGIC;

CONTEXT FREE LANGUAGES;

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

References (53)

1. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991), 308-340.
2. M. Bauderon and B. Courcelle, Graph expressions and graph rewritings, Math. Systems Theory 20 (1987), 83-127.
3. F. J. Brandenburg, On polynomial time graph grammars, in "Proc. STACS 88," Lecture Notes in Computer Science, Vol. 294, pp. 227-236, Springer-Verlag, Berlin, 1988.
4. J. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Logik Grundlag. Math. 6 (1960), 66-92.
5. B. Courcelle and J. Engelfriet, A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars, Math. Systems Theory 28 (1995), 515-552.
6. 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.
7. B. Courcelle, J. Engelfriet, and G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci. 46 (1993), 218-270.
8. D. G. Corneil, H. Lerchs, and L. Stewart Burlingham, Complement reducible graphs, Discr. Appl. Math. 3 (1981), 163-174.
9. B. Courcelle and M. Mosbah, Monadic second-order evaluations on tree decomposable graphs, Theor. Comput. Sci. 109 (1993), 49-82.
10. B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theor. Comput. Sci. 55 (1987), 141-181.
11. B. Courcelle, The monadic second-order logic of graphs I: Recognizable sets of finite graphs, Inform. and Comput. 85 (1990), 12-75.
12. B. Courcelle, Graph rewriting: An algebraic and logic approach, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 193-242, Elsevier, Amsterdam, 1990.
13. B. Courcelle, The monadic second-order logic of graphs V: On closing the gap between definability and recognizability, Theor. Comput. Sci. 80 (1991), 153-202.
14. B. Courcelle, The monadic second-order logic of graphs VII: Graphs as relational structures, Theor. Comput. Sci. 101 (1992), 3-33.
15. B. Courcelle, Monadic second-order definable graph transductions: A survey, Theor. Comput. Sci. 126 (1994), 53-75.
16. B. Courcelle, Structural properties of context-free sets of graphs generated by vertex replacement, Inform. and Comput. 116 (1995), 275-293.
17. B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, chapter in [Roz].
18. F. Drewes and J. Engelfriet, Decidability of the finiteness of ranges of tree transductions, Report 9/96, University of Bremen, December 1996.
19. F. Drewes, A. Habel, and H.-J. Kreowski, Hyperedge replacement graph grammars, chapter in [Roz].
20. J. Doner, Tree acceptors and some of their applications, J. Comput. Syst. Sci. 4 (1970), 406-451.
21. F. Drewes, Computation by tree transductions, Ph.D. thesis, University of Bremen, February 1996.
22. 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.
23. 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.
24. J. Engelfriet and G. Leih, Linear graph grammars: power and complexity, Inform. and Comput. 81 (1989), 88-121.
25. C. C. Elgot, Decision problems of finite automata and related arithmetics, Trans. Amer. Math. Soc. 98 (1961), 21-51.
26. J. Engelfriet, G. Leih, and E. Welzl, Boundary graph grammars with dynamic edge relabeling, J. Comput. Syst. Sci. 40 (1990), 307-345.
27. J. Engelfriet, Monadic second-order logic for graphs, trees, and strings, Copies of transparencies, November 1988.
28. J. Engelfriet, Context-free NCE graph grammars, in "Proc. FCT '89," Lecture Notes in Computer Science, Vol. 380, pp. 148-161, Springer-Verlag, Berlin, 1989.
29. J. Engelfriet, A characterization of context-free NCE graph languages by monadic second-order logic on trees, in [EKR pp. 311-327].
30. J. Engelfriet, A regular characterization of graph languages definable in monadic second-order logic, Theor. Comput. Sci. 88 (1991), 139-150.
31. J. Engelfriet, Graph grammars and tree transducers, in "Proc. CAAP '94" (S. Tison, Ed.), Lecture Notes in Computer Science, Vol. 787, pp. 15-36, Springer-Verlag, Berlin, 1994.
32. J. Engelfriet, Context-free graph grammars, chapter in the "Handbook of Formal Languages" (G. Rozenberg and A. Salomaa, Eds.), Vol. III, Springer-Verlag, New York/Berlin, 1997.
33. 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.
34. J. Engelfriet and V. van Oostrom, Regular description of context-free graph languages, J. Comput. Syst. Sci. 53 (1996), 556-574.
35. J. Engelfriet and G. Rozenberg, A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. and Comput. 84 (1990), 163-206.
36. J. Engelfriet and G. Rozenberg, Node replacement graph grammars, chapter in [Roz].
37. F. Gécseg and M. Steinby, "Tree Automata," Akad. Kiadó, Budapest, 1984.
38. A. Habel, "Hyperedge Replacement: Grammars and Languages," Lecture Notes in Computer Science, Vol. 643, Springer-Verlag, New York/Berlin, 1992.
39. A. Habel and H.-J. Kreowski, May we introduce to you: Hyperedge replacement, in [ENRR, pp. 15-26].
40. A. Habel, H.-J. Kreowski, and W. Vogler, Metatheorems for decision problems on hyperedge replacement graph languages, Acta Inform. 26 (1989), 657-677.
41. A. Habel, H.-J. Kreowski, and W. Vogler, Decidable boundedness problems for sets of graphs generated by hyperedge replacement, Theor. Comput. Sci. 89 (1991), 33-62.
42. J. E. Hopcroft and J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA, 1979.
43. M. Kaul, "Syntaxanalyse von Graphen bei Präzedenz-GraphGrammatiken," Dissertation, Universität Osnabrück, 1985.
44. T. Lengauer and E. Wanke, Efficient decision procedures for graph properties on context-free graph languages, J. Assoc. Comput. Mach. 40 (1993), 368-393.
45. J. Mezei and J. B. Wright, Algebraic automata and context-free sets, Inform. and Control 11 (1967), 3-29.
46. V. van Oostrom, Graph grammars and 2nd order logic, M.Sc. thesis, Leiden University, January 1989. [in Dutch]
47. G. Rozenberg (Ed.), "Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I. Foundations," World Scientific, Singapore, 1997.
48. G. Rozenberg and E. Welzl, Boundary NLC graph grammars -Basic definitions, normal forms, and complexity, Inform. and Control 69 (1986), 136-167.
49. G. Rozenberg and E. Welzl, Combinatorial properties of boundary NLC graph languages, Discr. Appl. Math. 16 (1987), 59-73.
50. R. Schuster, "Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität," Technical Report MIP-8711, Universität Passau, 1987.
51. W. Thomas, Automata on infinite objects, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 133-192, Elsevier, Amsterdam, 1990.
52. J. W. Thatcher and J. B. Wright, Generalized finite automata theory with an application to a decision problem of secondorder logic, Math. Systems Theory 2 (1968), 57-81.
53. E. Welzl, Boundary NLC and partition controlled graph grammars, in [ENRR, pp. 593-609].