Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach

Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach

Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach

Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach

Hardcover

$216.00 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Related collections and offers


Overview

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.

Product Details

ISBN-13: 9780521898331
Publisher: Cambridge University Press
Publication date: 06/14/2012
Series: Encyclopedia of Mathematics and its Applications , #138
Pages: 744
Product dimensions: 6.20(w) x 9.30(h) x 1.60(d)

About the Author

Bruno Courcelle is a Professor at Bordeaux 1 University and a member of LaBRI (the Bordeaux Laboratory of Computer Science, CNRS) and of the Institut Universitaire de France. After studying at the École Normale Supérieure, he was a researcher at INRIA (1972–8), before becoming a Professor at Bordeaux in 1979. He obtained his PhD (supervised by M. Nivat), in 1976. He is on the editorial boards for the journals Information and Computation and Logical Methods in Computer Science.

Table of Contents

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; 9. Relational structures; Conclusion and open problems; References; Index of notation; Index.
From the B&N Reads Blog

Customer Reviews