The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
Theoretical Computer Science
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
The monadic second-order logic of graphs X: linear orderings
Theoretical Computer Science
Languages, automata, and logic
Handbook of formal languages, vol. 3
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Series-parallel languages and the bounded-width property
Theoretical Computer Science
Rationality in algebras with a series operation
Information and Computation
Regular Tree Languages Without Unary Symbols are Star-Free
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
| Hi-index | 0.00 |
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order logic, a natural extension of monadic second-order logic), and to be recognizable in an algebraic framework induced by the notion of modular decomposition of a finite graph. More precisely, we consider the set F∞ of composition operations on graphs which occur in the modular decomposition of finite graphs. If F is a subset of F∞ we say that a graph is an F-graph if it can be decomposed using only operations in F. A set of F-graphs is recognizable if it is a union of classes in a finite-index equivalence relation which is preserved by the operations in F. We show that if F is finite and its elements enjoy only a limited amount of commutativity-a property which we call weak rigidity, then recognizability is equivalent to CMS-definability. This requirement is weak enough to be satisfied whenever all F-graphs are posets, that is, transitive dags. In particular, our result generalizes Kuske's recent result on series-parallel poset languages.