Corpus ID: 724637

Fly-automata, model-checking and recognizability

@article{Courcelle2014FlyautomataMA,
  title={Fly-automata, model-checking and recognizability},
  author={B. Courcelle and I. Durand},
  journal={ArXiv},
  year={2014},
  volume={abs/1409.5368}
}
  • B. Courcelle, I. Durand
  • Published 2014
  • Computer Science, Mathematics
  • ArXiv
  • The Recognizability Theorem states that if a set of finite graphs is definable by a monadic second-order (MSO) sentence, then it is recognizable with respect to the graph algebra upon which the definition of clique-width is based. Recognizability is an algebraic notion, defined in terms of congruences that can also be formulated by means of finite automata on the terms that describe the considered graphs. This theorem entails that the verification of MSO graph properties, or equivalently, the… CONTINUE READING
    Computations by fly-automata beyond monadic second-order logic
    15
    Fly-automata for checking MSO 2 graph properties
    3
    From tree-decompositions to clique-width terms
    8

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES
    Computations by fly-automata beyond monadic second-order logic
    15
    Automata for the verification of monadic second-order graph properties
    34
    Model-Checking by Infinite Fly-Automata
    6
    Courcelle's theorem - A game-theoretic approach
    54
    The complexity of first-order and monadic second-order logic revisited
    88
    Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach
    367
    Clique-Width is NP-Complete
    103
    Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
    293
    Parameterized Complexity Theory
    1940