CMI Library

Your cart is empty.
Normal view MARC view ISBD view

Graph structure and monadic second-order logic : a language-theoretic approach / Bruno Courcelle, Joost Engelfriet.

By: Courcelle, B.
Contributor(s): Engelfriet, Joost.
Material type: TextTextSeries: Encyclopedia of mathematics and its applications ; 138.Publisher: Cambridge ; New York : Cambridge University Press, 2012Description: xiv, 728 p., UKP 99.00 ill. ; 25 cm.ISBN: 9780521898331 (hardback).Subject(s): Logic, Symbolic and mathematical -- Graphic methods | MATHEMATICS / LogicDDC classification: 511.3 Other classification: MAT018000 Online resources: Cover image
Contents:
Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index.
Summary: "The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The author not only provides a thorough description of the theory, but also details its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory"--
Item type Current location Call number Status Date due Barcode Item holds
Book Chennai Mathematical Institute
General Stacks 		511.3 COU (Browse shelf) Available 8852
Book Chennai Mathematical Institute
General Stacks 		511.3 COU (Browse shelf) Available 8655
Total holds: 0

Includes bibliographical references (p. [691]-710) and index.

Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index.

"The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The author not only provides a thorough description of the theory, but also details its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory"--