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
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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
Engelfriet, J.: A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. Theoretical Computer Science 88, 139–150 (1991)
Makowsky, J.: Algorithmic uses of the Feferman-Vaught Theorem. Ann. Pure Appl. Logic 126, 159–213 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)