Description 
xiv, 728 p. : ill. ; 25 cm. 
Series 
Encyclopedia of mathematics and its applications ; v. 138.

Bibliography 
Includes bibliographical references (p. [691]710) and index. 
Contents 
Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in manysorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic secondorder logic; 6. Algorithmic applications; 7. Monadic secondorder 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 secondorder 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" Provided by publisher. 
Subject 
Logic, Symbolic and mathematical  Graphic methods.

Related Names 
Engelfriet, Joost.

ISBN 
0521898331 (hardback) 

9780521898331 (hardback) 
OCLC number 
779740328 
