Recognizable sets of graphs: equivalent definitions and closure properties

The notion of a recognizable set of words, trees or graphs is relative to an algebraic structure on the set of words, trees or graphs respectively. We establish that several algebraic structures yield the same notion of a recognizable set of graphs. This notion is equivalent to that of a fully cutset-regular set of graphs introduced by Fellows and Abrahamson. We also establish that the class of recognizable sets of graphs is closed under the operations considered in these various equivalent definitions. This fact is not a standard consequence of the definition of recognizability.

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

[2]  Annegret Habel,et al.  A Comparison of Compatible, Finite, and Inductive Graph Properties , 1993, Theor. Comput. Sci..

[3]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1990, JACM.

[4]  Bruno Courcelle,et al.  Recognizable Sets of Graphs of Bounded Tree-Width , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

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

[6]  Andreas Podelski,et al.  Tree Automata and Languages , 1992 .

[7]  Damian Niwinski,et al.  Fixed point characterization of weak monadic logic definable sets of trees , 1992, Tree Automata and Languages.

[8]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[9]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

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

[11]  Bruno Courcelle,et al.  Graph grammars, monadic second-order logic and the theory of graph minors , 1991, Graph Structure Theory.

[12]  Michael R. Fellows,et al.  Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.

[13]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[14]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[15]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[16]  B. Courcelle.  On Recognizable Sets and Tree Automata , 1989 .

[17]  Thomas Lengauer,et al.  Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract) , 1988, ICALP.

[18]  Bruno Courcelle,et al.  An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..

[19]  Bruno Courcelle,et al.  Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars , 1986, Theor. Comput. Sci..

[20]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[21]  Ferenc Gécseg,et al.  Tree Automata , 2015, ArXiv.

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