May we introduce to you: hyperedge replacement

In this kind of tutorial note, we explain how graphs can be rewritten by edge replacement. The formal definitions are accompanied by intuitive descriptions and a series of examples.

[1]  Bruno Courcelle,et al.  An Algebraic Formalism for Graphs , 1986, CAAP.

[2]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[3]  Seymour Ginsburg,et al.  Two Families of Languages Related to ALGOL , 1962, JACM.

[4]  Carlo Ghezzi,et al.  Context-Free Graph Grammars , 1978, Inf. Control..

[5]  Manfred Kaul.  Parsing of graphs in linear time , 1982, Graph-Grammars and Their Application to Computer Science.

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

[7]  Ulrike Lichtblau.  Decompilation of Control Structures by Means of Graph Transformations , 1985, TAPSOFT, Vol.1.

[8]  Annegret Habel,et al.  On context-free gragh languages generated by edge replacement , 1982, Graph-Grammars and Their Application to Computer Science.

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

[10]  Jerome Feder,et al.  Plex languages , 1971, Inf. Sci..

[11]  Ken Kennedy,et al.  Graph grammars and global program data flow analysis , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[12]  Theodosios Pavlidis,et al.  Linear and Context-Free Graph Grammars , 1972, JACM.

[13]  Hans-Jörg Kreowski,et al.  Note on Node-Rewriting Graph Grammars , 1984, Inf. Process. Lett..

[14]  Robert Valette,et al.  Analysis of Petri Nets by Stepwise Refinements , 1979, J. Comput. Syst. Sci..

[15]  Mary Katherine Yntema,et al.  Cap Expressions for Context-Free Languages , 1971, Inf. Control..

[16]  Jozef Gruska.  A Characterization of Context-free Languages , 1971, J. Comput. Syst. Sci..

[17]  Hans-Jörg Kreowski.  A Pumping Lemma for Context-Free Graph Languages , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[18]  H. Kreowski.  Rule Trees Represent Derivations in Edge Replacement Systems , 1986 .

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

[20]  Grzegorz Rozenberg,et al.  Decision Problems for Node Label Controlled Graph Grammars , 1981, J. Comput. Syst. Sci..

[21]  Ichiro Suzuki,et al.  Stepwise Refinements of Transitions and Places , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[22]  Terrence W. Pratt,et al.  Pair Grammars, Graph Languages and String-to-Graph Translations , 1971, J. Comput. Syst. Sci..

[23]  Grzegorz Rozenberg,et al.  The Book of L , 1986, Springer Berlin Heidelberg.

[24]  György Turán,et al.  On the complexity of graph grammars , 1983, Acta Cybernetica.