Abstract
A graph language L is in the class C-edNCE of context-free NCE graph languages if and only if L=f(T) where f is a function on graphs that can be defined in monadic second-order logic and T is the set of all trees over some ranked alphabet. This logical characterization implies a large number of closure and decidability properties of the class C-edNCE.
Keywords
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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
M. Bauderon, B. Courcelle; Graph expressions and graph rewritings, Math. Systems Theory 20 (1987), 83–127
F.J. Brandenburg; On polynomial time graph grammars, Proc. STACS 88, Lecture Notes in Computer Science 294, Springer-Verlag, Berlin, 227–236
J.R. Büchi; Weak second-order arithmetic and finite automata, Zeitschr. f. Math. Logik und Grundlagen d. Math. 6 (1960), 66–92
D.G. Corneil, H. Lerchs, L.Stewart Burlingham; Complement reducible graphs, Discr. Appl. Math. 3 (1981), 163–174
B. Courcelle; An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theor. Comput. Sci. 55 (1987), 141–181
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
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
B.Courcelle; The monadic second-order logic of graphs. VII: Graphs as relational structures, Manuscript, University of Bordeaux, 1990
B.Courcelle; Graphs as relational structures: an algebraic and logical approach, this Volume
B.Courcelle, J.Engelfriet, G.Rozenberg; Context-free handle-rewriting hypergraph grammars, this Volume
J. Doner; Tree acceptors and some of their applications, J. Comput. System Sci. 4 (1970), 406–451
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
C.C. Elgot; Decision problems of finite automata and related arithmetics, Trans. Amer. Math. Soc. 98 (1961), 21–51
J.Engelfriet; Monadic second-order logic for graphs, trees, and strings, Copies of transparencies, November 1988
J. Engelfriet; Context-free NCE graph grammars, Proc. FCT '89, Lecture Notes in Computer Science 380, Springer-Verlag, Berlin, 1989, 148–161
J.Engelfriet; A regular characterization of graph languages definable in monadic second-order logic, Report 89-03, Leiden University, 1989, to appear in TCS
J. Engelfriet, G. Leih; Linear graph grammars: power and complexity, Inform. Comput. 81 (1989), 88–121
J.Engelfriet, G.Leih, G.Rozenberg; Apex graph grammars, in [EhrNagRozRos87], 167–185
J. Engelfriet, G. Leih, E. Welzl; Boundary graph grammars with dynamic edge relabeling, J. Comput. System Sci. 40 (1990), 307–345
J. Engelfriet, G. Rozenberg; A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. Comput. 84 (1990), 163–206
F. Gécseg, M. Steinby; "Tree automata", Akadémiai Kiadó, Budapest, 1984
A. Habel, H.-J. Krewoski; May we introduce to you: hyperedge replacement, in 15–26
A. Habel, H.-J. Kreowski, W. Vogler; Decidable boundedness problems for hyperedge-replacement graph grammars, in Proc. TAPSOFT '89, Lecture Notes in Computer Science 351, Springer-Verlag, Berlin, 1989, 275–289
A. Habel, H.-J. Kreowski, W. Vogler; Metatheorems for decision problems on hyperedge replacement graph languages, Acta Informatica 26 (1989), 657–677
M.Kaul; Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken, Ph.D.Thesis, Osnabrück, 1985
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
M. Nagl; "Graph-grammatiken", Vieweg, Braunschweig, 1979.
V.van Oostrom; Graph grammars and 2nd order logic (in Dutch), M. Sc. Thesis, 1989
G.Rozenberg; An introduction to the NLC way of rewriting graphs, in [EhrNagRozRos87], 55–66
G. Rozenberg, E. Welzl; Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Inform. Contr. 69 (1986), 136–167
G. Rozenberg, E. Welzl; Combinatorial properties of boundary NLC graph languages, Discr. Appl. Math. 16 (1987), 59–73
R.Schuster; Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität, Ph.D.Thesis, Report MIP-8711, Passau, 1987
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
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J. (1991). A characterization of context-free NCE graph languages by monadic second-order logic on trees. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017397
Download citation
DOI: https://doi.org/10.1007/BFb0017397
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54478-4
Online ISBN: 978-3-540-38395-6
eBook Packages: Springer Book Archive