Handle-Rewriting Hypergraph Grammars

Abstract We introduce the handle-rewriting hypergraph grammars (HH grammars), based on the replacement of handles, i.e., of subhypergraphs consisting of one hyperedge together with its incident vertices. This extends hyperedge replacement, where only the hyperedge is replaced. A HH grammar is separated (an S-HH grammar) if nonterminal handles do not overlap. The S-HH grammars are context-free, and the sets they generate can be characterized as the least solutions of certain systems of equations. They generate the same sets of graphs as the NLC-like vertex-rewriting C-edNCE graph grammars that are also context-free.

[1]  Grzegorz Rozenberg,et al.  Edge-Label Controlled Graph Grammars , 1990, J. Comput. Syst. Sci..

[2]  Annegret Habel,et al.  Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

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

[4]  Joost Engelfriet,et al.  Apex Graph Grammars , 1986, Graph-Grammars and Their Application to Computer Science.

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

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

[7]  Joost Engelfriet,et al.  Nonterminal Separation in Graph Grammars , 1991, Theor. Comput. Sci..

[8]  Bruno Courcelle,et al.  Context-free Handle-rewriting Hypergraph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[9]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

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

[11]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

[12]  Joost Engelfriet,et al.  Linear Graph Grammars: Power and Complexity , 1989, Inf. Comput..

[13]  Joost Engelfriet,et al.  Boundary Graph Grammars with Dynamic Edge Relabeling , 1990, J. Comput. Syst. Sci..

[14]  Francesca Rossi,et al.  An Efficient Algorithm for the Solution of Hierarchical Networks of Constraints , 1986, Graph-Grammars and Their Application to Computer Science.

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

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

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

[18]  Franz-Josef Brandenburg.  On Partially Ordered Graph Grammars , 1986, Graph-Grammars and Their Application to Computer Science.

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

[20]  Grzegorz Rozenberg,et al.  Handle NLC Grammars and R.E. Languages , 1987, J. Comput. Syst. Sci..

[21]  Franz-Josef Brandenburg.  On Polynomial Time Graph Grammars , 1988, STACS.

[22]  Clemens Lautemann,et al.  Efficient Algorithms on Context-Free Graph Grammars , 1988, ICALP.

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

[24]  Grzegorz Rozenberg,et al.  A Survey of NLC Grammars , 1983, CAAP.

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

[26]  Grzegorz Rozenberg,et al.  On the structure of node-label-controlled graph languages , 1980, Inf. Sci..

[27]  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.

[28]  Bruno Courcelle,et al.  Graphs as Relational Structures: An Algebraic an Logical Approach , 1990, Graph-Grammars and Their Application to Computer Science.

[29]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs , 1988, WG.

[30]  Annegret Habel,et al.  May we introduce to you: hyperedge replacement , 1986, Graph-Grammars and Their Application to Computer Science.

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

[32]  Joost Engelfriet.  Context-Free NCE Graph Grammars , 1989, FCT.