The Expression Of Graph Properties And Graph Transformations In Monadic Second-Order Logic

The Expression Of Graph Properties And Graph Transformations In Monadic Second-Order Logic (1997)

Cached

Download Links

[dept-info.labri.u-bordeaux.fr]

Other Repositories/Bibliography

DBLP

by B. Courcelle

Citations:

127 - 32 self

BibTeX

@INPROCEEDINGS{Courcelle97theexpression,
    author = {B. Courcelle},
    title = {The Expression Of Graph Properties And Graph Transformations In Monadic Second-Order Logic},
    booktitle = {},
    year = {1997},
    pages = {313--400},
    publisher = {World Scientific}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

By considering graphs as logical structures, one...

Citations

928	Modern graph theory - Bollobás - 1998
236	The polynomial-time hierarchy - Stockmeyer - 1977
170	The monadic second-order logic of graphs. I. Recognizable sets of finite graphs - Courcelle - 1990
157	Tree acceptors and some of their applications - Doner - 1970
102	Transductions and Context-Free Languages, Teubner - Berstel - 1979
87	The monadic theory of order - Shelah - 1975
80	Graph minors. V. Excluding a planar graph - Robertson, Seymour - 1986
78	Automata on in objects - Thomas - 1990
70	Classifying regular events in symbolic logic - Thomas - 1982
69	Graph expressions and graph rewriting - Bauderon, Courcelle - 1987
63	Monadic second-order evaluations on tree-decomposable graphs, Theoret - Courcelle, Mosbah - 1993
63	Universal algebra for computer scientists - Wechler - 1992
53	Algebraic automata and context-free sets, in - Mezei, Wright - 1967
49	Languages which Capture Complexity Classes - Immerman - 1983
48	Hyperedge replacement : grammars and languages - Habel
38	The monadic second-order logic of graphs iii: treedecompositions, minor and complexity issues - Courcelle - 1992
37	The structure of the models of decidable monadic theories of graphs - Seese - 1991
30	An analogue of the Myhill-Nerode theorem and its use in computingfinite-basis characterizations - Fellows, Langston
28	The monadic second-order logic of graphs V: On closing the gap beween definability and recorgnizability, Theoret - Courcelle - 1991
27	The first-order properties of products of algebraic systems. Fundamenta Mathematica 47:57–103 - Feferman, Vaught - 1959
25	The monadic second-order logic of graphs X: Linear orderings - Courcelle - 1996
25	Logic, semigroups and automata on words - Pin - 1996
23	Problems easy for tree-decomposable graphs - Arnborg, Lagergren, et al.
22	Generalized automata theory with an application to a decision-problem of second-order logic - Thatcher, Wright - 1968
21	L.: The string generating power of context-free hypergraph grammars - Engelfriet, Heyker - 1991
21	Graph grammars based on node rewriting: An introduction to NLC graph grammars - Engelfriet, Rozenberg - 1990
20	Monadic second-order logic of graphs VII: graphs as relational structures, Theoret - Courcelle - 1992
19	The monadic second-order logic of graphs - Courcelle - 1990
18	The monadic second-order logic of graphs VI: On several representations of graphs by relational structures, Discrete Applied Mathematics 54 - Courcelle - 1994
17	Fundamentals of Algebraic Speci 1: Equations and Initial Semantics - Ehrig, Mahr - 1985
15	Structural properties of context-free sets of graphs generated by vertex replacement - Courcelle - 1995
14	Basic notions of universal algebra for language theory and graph grammars, Theoret - Courcelle - 1996
13	Decision problems of automata design and related arithmetics - Elgot - 1961
12	Generalized spectra and polynomial-time recognizable sets - Fagin - 1974
11	A characterizarion of context-free NCE graph languages by monadic second-order logic on trees - Engelfriet - 1990
9	Context-free NCE graph grammars - Engelfriet
8	Graph Grammars, Monadic Second-Order Logic And The Theory Of Graph Minors - Courcelle - 1993
7	The monadic second-order logic of graphs VIII - Courcelle - 1995
7	Two families of languages related to - Ginsburg, Rice - 1962
7	Definability equals recognizability of partial 3-trees - Kaller - 1996
7	Commutative regular equations and Parikh’s theorem - Pilling - 1973
6	Decidability of the con of ground term rewrite systems and of other related term rewrite systems - Dauchet, Heuillard, et al. - 1990
5	A Kleene Theorem for a class of planar acyclic graphs - Bossut, Dauchet, et al. - 1995
5	Hypergraph languages of bounded degree - Engelfriet, Heyker - 1994
4	A logical characterization of the sets of hypergraphs de by hyperedge replacement grammars - Courcelle, Engelfriet - 1995
3	An axiomatic de of context-free rewriting and its application to NLC graph grammars - Courcelle - 1987
2	Finding minimal forbidden minors using a congruence - Lagergren, Arnborg - 1991
2	Impossibility of an algorithm for the decision problem on classes, Doklady 70 - Trakhtenbrot - 1950
1	Weak second-order logic and automata - BUCHI - 1960
1	Monadic second-order de transductions : a survey, Theoret - COURCELLE - 1994