The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability

@article{Courcelle1991TheMS,
  title={The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability},
  author={Bruno Courcelle},
  journal={Theor. Comput. Sci.},
  year={1991},
  volume={80},
  pages={153-202}
}
Courcelle, B., The monadic second-order logic of graphs V: on closing the gap between definability and recognizability, Theoretical Computer Science 80 (1991) 153-202. Context-free graph-grammars are considered such that, in every generated graph (3, a derivation tree of G can be constructed by means of monadic second-order formulas that specify its nodes, its labels, the successors of a node etc. A subset of the set of graphs generated by such a grammar is recognizable iff it is definable in… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 62 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 40 references

The monadic second-order logic of Kr'~ph, lib tree-decompositions minors, and complexity issues

  • B Courcelle
  • The monadic second-order logic of Kr'~ph, lib…
  • 1990
1 Excerpt

On recognizable sets and tree-automata

  • B Courcelle
  • Resolutinn ¢~I Equations in Algehraic Struelure.s
  • 1989

Lagergren and 1). Seese, Problems easy for tree-decomposable graphs, in: l('ALP'88

  • S Arnborg
  • Lecture Notes in Computer Science
  • 1988

An Elh'ciem AIgorilhm .lbr the Solulion 0/ Hierarchical Nt'tworks o/ Constraint.s

  • U Montanari, I Rossi
  • Lecture Notes in Computer Science
  • 1987

Similar Papers

Loading similar papers…