A characterization of context-free NCE graph languages by monadic second-order logic on trees

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

Volumn 532 LNCS, Issue , 1991, Pages 311-327

  Engelfriet, Joost ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Context free graph grammar; Monadic second order logic; Tree

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER CIRCUITS; CONTEXT FREE GRAMMARS; CONTEXT SENSITIVE GRAMMARS; FORESTRY; FORMAL LANGUAGES; FORMAL LOGIC; GRAPH THEORY; TREES (MATHEMATICS); VISUAL LANGUAGES;

CONTEXT-FREE; CONTEXT-FREE GRAPH GRAMMARS; DECIDABILITY PROPERTIES; GRAPH LANGUAGES; LOGICAL CHARACTERIZATION; MONADIC SECOND-ORDER LOGIC; TREE;

CONTEXT FREE LANGUAGES;

EID: 84909938476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0017397     Document Type: Conference Paper

References (34)

1. S. Arnborg, J. Lagergren, D.Seese; Problems easy for tree-decomposable graphs, Proc. ICALP '88, Lecture Notes in Computer Science 317, Springer-Verlag, Berlin, 1988, 38-51
2. M. Bauderon, B.Courcelle, Graph expressions and graph rewritings, Math. Systems Theory 20 (1987), 83-127
3. F.J.Brandenburg; On polynomial time graph grammars, Proc. STACS 88, Lecture Notes in Computer Science 294, Springer-Verlag, Berlin, 227-236
4. J.R. Büchi, Weak second-order arithmetic and finite automata, Zeitschr. f. Math. Logik und Grundlagen d. Math. 6 (1960), 66-92
5. D.G. Corneil, H. Lerchs, L. Stewart Burlingham; Complement reducible graphs, Discr. Appl. Math. 3 (1981), 163-174
6. B.Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theor. Comput. Sei. 55 (1987), 141-181
7. B.Courcelle, The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability, Report 89-91, LaBRI, University of Bordeaux, 1989, to appear in TCS
8. B.Courcelle, The monadic second-order logic of graphs. I: Recognizable sets of finite graphs, Inform. Comput. 85 (1990), 12-75. See also [EhrNagRozRos87], 112-133
9. B.Courcelle, The monadic second-order logic of graphs. VII: Graphs as relational structures, Manuscript, University of Bordeaux, 1990
10. B.Courcelle, Graphs as relational structures: an algebraic and logical approach, this Volume
11. B. Courcelle, J. Engelfriet, G. Rozenberg; Context-free handle-rewriting hypergraph grammars, this Volume
12. J.Doner; Tree acceptors and some of their applications, J. Comput. System Sei. 4 (1970), 406-451
13. H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.); Graph-Grammars and their Application to Computer Science, Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987
14. C.C.Elgot; Decision problems of finite automata and related arithmetics, Trans. Amer. Math. Soc. 98 (1961), 21-51
15. J.Engelfriet; Monadic second-order logic for graphs, trees, and strings, Copies of transparencies, November 1988
16. J.Engelfriet; Context-free NCE graph grammars, Proc. FCT '89, Lecture Notes in Computer Science 380, Springer-Verlag, Berlin, 1989, 148-161
17. J.Engelfriet; A regular characterization of graph languages definable in monadic second-order logic, Report 89-03, Leiden University, 1989, to appear in TCS
18. J. Engelfriet, G.Leih; Linear graph grammars: power and complexity, Inform. Comput. 81 (1989), 88-121
19. J. Engelfriet, G. Leih, G. Rozenberg; Apex graph grammars, in [EhrNagRozRos87], 167-185
20. J. Engelfriet, G. Leih, E.Welzl; Boundary graph grammars with dynamic edge relabeling, J. Comput. System Sei. 40 (1990), 307-345
21. J. Engelfriet, G. Rozenberg; A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. Comput. 84 (1990), 163-206
22. F. Gfecseg, M.Steinby; “Tree automata”, Akademiai Kiado, Budapest, 1984
23. A. Habel, H.-J.Kreowski; May we introduce to you: hyperedge replacement, in [EhrNagRozRos87], 15-26
24. A. Habel, H.-J. Kreowski, W.Vogler; Oecidable boundedness problems for hyperedge-replacement graph grammars, in Proc. TAPSOFT '89, Lecture Notes in Computer Science 351, Springer-Verlag, Berlin, 1989, 275-289
25. A. Habel, H.-J. Kreowski, W.Vogler; Metatheorems for decision problems on hyperedge replacement graph languages, Acta Informatica 26 (1989), 657-677
26. M.Kaul; Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken, Ph.D. Thesis, Osnabrück, 1985
27. T. Lengauer, E.Wanke; Efficient analysis of graph properties on context-free graph languages, Proc. ICALP '88, Lecture Notes in Computer Science 317, Springer-Verlag, Berlin, 1988, 379-393
28. M.Nagl; “Graph-grammatiken”, Vieweg, Braunschweig, 1979.
29. V. van Oostrom; Graph grammars and 2nd order logic (in Dutch), M. Sc. Thesis, 1989
30. G. Rozenberg; An introduction to the NLC way of rewriting graphs, in [EhrNagRozRos87], 55-66
31. G. Rozenberg, E.Welzl; Boundary NLC graph grammars-basic definitions, normal forms, and complexity, Inform. Contr. 69 (1986), 136-167
32. G. Rozenberg, E.Welzl; Combinatorial properties of boundary NLC graph languages, Discr. Appl. Math. 16 (1987), 59-73
33. R.Schuster; Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität, Ph.D. Thesis, Report MIP-8711, Passau, 1987
34. J.W. Thatcher, J.B.Wright; Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Syst. Theory 2 (1968), 57-81