Fusion in relational structures and the verification of monadic second-order properties

DOI10.1017/S0960129501003565zbMath1005.68105MaRDI QIDQ3146251

Bruno Courcelle, Johann A. Makowsky

Publication date: 16 October 2002

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

vertex replacementhyperedge replacement context-free graph grammars

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

The parametrized complexity of knot polynomials, Simple monadic theories and partition width, The rank-width of edge-coloured graphs, Algorithmic uses of the Feferman-Vaught theorem, $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs, Counting truth assignments of formulas of bounded tree-width or clique-width, Effective optimization with weighted automata on decomposable trees, GETGRATS, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, The monadic second-order logic of graphs. XV: On a conjecture by D. Seese, Recognizability, hypergraph operations, and logical types, Linear Recurrence Relations for Graph Polynomials, Unnamed Item