On context-free sets of graphs and their monadic second-order theory
The algebraic framework for studying graphs yields a notion of system of equations defining equational sets of graphs. Context-free graph grammars (where the rewriting step is the substitution a graph for an hyperedge) are defined. The context-free and the equational sets of graphs are the same. The monadic second-order theory of a context-free set of graphs is decidable.
KeywordsContext-free graph grammar Monadic second-order logic decision problem
Unable to display preview. Download preview PDF.
- J.R. BUCHI, Weak 2nd order logic and finite automata, Z. Math Logik 5(960) 66–92.Google Scholar
- B. COURCELLE, A representation of graphs by algebraic expressions and its use for graph rewriting systems, this volume.Google Scholar
- B. COURCELLE, An axiomatic definition of context-free rewriting and its application to NLC grammars, Report 8706, Bordeaux 1 University, 1987.Google Scholar
- J.DONER, Tree acceptors and applications. Jour. Comput. System Sci. 4(70) 406–451Google Scholar
- P. SEYMOUR, N. ROBERTSON, Some new results on the well quasiordering of graphs, Annals of Discrete Maths 23 (1984) 343–354.Google Scholar