Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications

Authors:
Bruno Courcelle
Affiliations:
Institut Universitaire de France, Université Bordeaux-1, LaBRI, CNRS, Talence cedex, France 33405
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 4
Cited 1

Monadic second-order evaluations on tree-decomposable graphs

Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
The expression of graph properties and graph transformations in monadic second-order logic

Handbook of graph grammars and computing by graph transformation
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I

Formal verification techniques for model transformations specified by-demonstration

Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-width and clique-width. It will review applications to the construction of algorithms, to Graph Theory and to the extension to graphs of Formal Language Theory concepts.