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

Bruno Courcelle
2009 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-642-00982-2_2 fatcat:ryjvoaa7dnefrcruygfnpqso2i