Abstract
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly algebraic notions (equational and recognizable sets) and Monadic Second-Order logic (for defining sets and transformations of graphs, hypergraphs and relational structures) is reviewed. The lecture [3] is based on two submitted but nevertheless available articles [1,4] ; the present text is an informal overview. The numerous definitions and results can be found in the two articles.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blumensath, A., Courcelle, B.: Recognizability and hypergraph operations using local informations (July 2004), http://www.labri.fr/Perso/courcell/Textes/BCBlumensath-submitted2004.pdf
Courcelle, B.: Basic notions of Universal Algebra for Language Theory and Graph Grammars. Theoretical Computer Science 163, 1–54 (1996)
Courcelle, B.: Recognizable sets of graphs, hypergraphs and relational structures: a survey (slides), http://www.labri.fr/Perso/courcell/Conferences/ExpoDLT04.pdf
Courcelle, B., Weil, P.: The recognizability of sets of graphs is a robust property (December 2003), http://www.labri.fr/Perso/courcell/Textes/BC-Weil-submitted2004.pdf
Downey, R., Fellows, M.: Parametrized complexity. Springer, Heidelberg (1999)
Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control 11, 3–29 (1967)
Rozenberg, G. (ed.): Handbook of graph grammars and computing by graph transformations, vol. 1. World Scientific, Singapore (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B. (2004). Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-30550-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24014-3
Online ISBN: 978-3-540-30550-7
eBook Packages: Computer ScienceComputer Science (R0)