A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars

[1]  Bruno Courcelle,et al.  Monadic Second-Order Evaluations on Tree-Decomposable Graphs , 1993, Theor. Comput. Sci..

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

[3]  Annegret Habel,et al.  Characteristics of Graph Languages Generated by Edge Replacement , 1987, Theor. Comput. Sci..

[4]  Joost Engelfriet,et al.  Hypergraph Languages of Bounded Degree , 1994, J. Comput. Syst. Sci..

[5]  Annegret Habel,et al.  Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar , 1989, TAPSOFT, Vol.1.

[6]  Annegret Habel,et al.  Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement , 1987, STACS.

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

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

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

[10]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[11]  Joost Engelfriet,et al.  Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

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

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

[14]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

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

[16]  Bruno Courcelle,et al.  The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues , 1992, RAIRO Theor. Informatics Appl..

[17]  Franz-Josef Brandenburg.  The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree , 1991, RTA.

[18]  Bruno Courcelle.  Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement , 1995, Inf. Comput..

[19]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[20]  Joost Engelfriet,et al.  The String Generating Power of Context-Free Hypergraph Grammars , 1991, J. Comput. Syst. Sci..

[21]  Joost Engelfriet,et al.  A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars , 1990, Inf. Comput..

[22]  Grzegorz Rozenberg,et al.  Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity , 1986, Inf. Control..

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

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

[25]  Joost Engelfriet,et al.  A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees , 1990, Graph-Grammars and Their Application to Computer Science.

[26]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.