Recognizable sets of graphs, hypergraphs and relational structures: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3340, Issue , 2004, Pages 1-11

  Courcelle, Bruno ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

DEFINING SETS; EQUATIONAL SETS; FINITE GRAPHS; GRAPH STRUCTURES; HYPER GRAPH; MONADIC SECOND-ORDER LOGIC; NEW RESULTS; RECOGNIZABLE SET OF GRAPHS; RECOGNIZABLE SETS; RELATIONAL STRUCTURES;

GRAPH THEORY;

EID: 33645425454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30550-7_1     Document Type: Review

References (7)

1. A. Blumensath, B. Courcelle: Recognizability and hypergraph operations using local informations, July 2004, http://www.labri.fr/Perso/ courcell/Textes/ BC-Blumensath-submitted(2004).pdf
2. B. Courcelle: Basic notions of Universal Algebra for Language Theory and Graph Grammars, Theoretical Computer Science 163 (1996) 1-54.
3. B. Courcelle: Recognizable sets of graphs, hypergraphs and relational structures: a survey, http://www.labri.fr/Perso/ courcell/Conferences/ExpoDLT04. pdf, (slides).
4. B. Courcelle, P. Weil: The recognizability of sets of graphs is a robust property, December 2003, http://www.labri.fr/Perso/ courcell/Textes/BC-Weil- submitted (2004).pdf
5. R. Downey, M. Fellows: Parametrized complexity, Springer, 1999.
6. J. Mezei, J. B. Wright, Algebraic automata and context-free sets, Information and Control 11 (1967) 3-29.
7. G. Rozenberg ed., Handbook of graph grammars and computing by graph transformations, Volume 1, World Scientific, 1997.