HYPEREDGE REPLACEMENT GRAPH GRAMMARS [chapter]

F. DREWES, H.-J. KREOWSKI, A. HABEL
1997 Handbook of Graph Grammars and Computing by Graph Transformation  
In this survey the concept of hyperedge replacement is presented as an elementary approach to graph and hypergraph generation. In particular, hyperedge replacement graph grammars are discussed as a (hyper)graph-grammatical counterpart to context-free string grammars. To cover a large part of the theory of hyperedge replacement, structural properties and decision problems, including the membership problem, are addressed.
doi:10.1142/9789812384720_0002 fatcat:snksvj3gnfavxmy5ff4732mpnu