Recognizability, hypergraph operations, and logical types

We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which compare the associated equational and recognizable sets. The basic algebra on relational structures is based on disjoint union and quantifier-free definable operations. We expand it to an equivalent one by adding operations definable with ''few quantifiers'', i.e., operations that take into account local information about elements or tuples. We also consider monadic second-order transductions and we prove that the inverse image of a recognizable set under such a transduction is recognizable.

[1]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[2]  Bruno Courcelle,et al.  Basic Notions of Universal Algebra for Language Theory and Graph Grammars , 1996, Theor. Comput. Sci..

[3]  Jean-Claude Raoult,et al.  A survey of tree transductions , 1992, Tree Automata and Languages.

[4]  Tero Harju,et al.  Structure and organization , 2014 .

[5]  Bruno Courcelle,et al.  Recognizable sets of graphs: equivalent definitions and closure properties , 1994, Mathematical Structures in Computer Science.

[6]  W. Cunningham.  Decomposition of Directed Graphs , 1982 .

[7]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[8]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[9]  Bruno Courcelle,et al.  Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..

[10]  Joost Engelfriet,et al.  Regular Description of Context-Free Graph Languages , 1996, J. Comput. Syst. Sci..

[11]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

[12]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[13]  Denis Lapoire,et al.  Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width , 1998, STACS.

[14]  B. COURCELLE,et al.  Fusion in relational structures and the verification of monadic second-order properties , 2002, Mathematical Structures in Computer Science.

[15]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[16]  Joost Engelfriet,et al.  A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars , 2000, J. Comput. Syst. Sci..

[17]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[18]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures , 1992, Theor. Comput. Sci..

[19]  Bruno Courcelle,et al.  The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures , 1994, Discret. Appl. Math..

[20]  Tero Harju,et al.  The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs , 1997, Handbook of Graph Grammars.

[21]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[22]  Bruno Courcelle,et al.  The monadic second-order logic of graphs XVI : Canonical graph decompositions , 2005, Log. Methods Comput. Sci..

[23]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[24]  Bruno Courcelle,et al.  The recognizability of sets of graphs is a robust property , 2005, Theor. Comput. Sci..

[25]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..

[26]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[27]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[28]  Achim Blumensath.  Structures of bounded partition width , 2003 .

[29]  Johann A. Makowsky,et al.  Algorithmic uses of the Feferman-Vaught Theorem , 2004, Ann. Pure Appl. Log..

[30]  S. Shelah.  The monadic theory of order , 1975, 2305.00968.

[31]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[32]  Joost Engelfriet,et al.  Logical Description of Contex-Free Graph Languages , 1997, J. Comput. Syst. Sci..

[33]  Viktor Schuppan,et al.  Linear Encodings of Bounded LTL Model Checking , 2006, Log. Methods Comput. Sci..

[34]  Bruno Courcelle,et al.  Equivalent definitions of recognizability for sets of graphs of bounded tree-width , 1996, Mathematical Structures in Computer Science.

[35]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..

[36]  Joost Engelfriet,et al.  Macro Tree Translations of Linear Size Increase are MSO Definable , 2003, SIAM J. Comput..