# 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} }

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

#### Topics from this paper.

3 Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 14 REFERENCES

Automata for the verification of monadic second-order graph properties

- Computer Science, Mathematics
- 2012

34

On the model-checking of monadic second-order formulas with edge set quantifications

- Mathematics, Computer Science
- 2012

39

The complexity of first-order and monadic second-order logic revisited

- Mathematics, Computer Science
- 2004

88

Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach

- Computer Science
- 2012

367

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

- Computer Science, Mathematics
- 1998

293