Skip to main content
Springer Nature Link
Log in

On Several Proofs of the Recognizability Theorem

  • Conference paper
Algebraic Informatics (CAI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5725))

Included in the following conference series:

  • 433 Accesses

Abstract

The lecture has presented and compared several proofs of the fundamental Recognizability Theorem that relates the Monadic Second-order definability of a set of finite graphs or relational structures and its Recognizability, this notion being defined in terms of finite congruences and not in terms of automata.

Supported by the GRAAL project of ”Agence Nationale pour la Recherche”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. Courcelle, B.: Graph structure and monadic second-order logic, book in preparation, To be published by Cambridge University Press, http://www.labri.fr/perso/courcell/Book/CourGGBook.pdf

  2. Engelfriet, J.: A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. Theoretical Computer Science 88, 139–150 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Makowsky, J.: Algorithmic uses of the Feferman-Vaught Theorem. Ann. Pure Appl. Logic 126, 159–213 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Universitaire de France, Université Bordeaux-1, LaBRI, CNRS, 351, Cours de la Libération, 33405, Talence cedex, France

    Bruno Courcelle

Authors
  1. Bruno Courcelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    Symeon Bozapalidis

  2. Department of Mathematics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Courcelle, B. (2009). On Several Proofs of the Recognizability Theorem. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03564-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03564-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03563-0

  • Online ISBN: 978-3-642-03564-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics