Characteristics of Graph Languages Generated by Edge Replacement

Abstract Edge replacement systems provide a simple mechanism for generating graph languages. They generalize context-free (string) grammars to the case of graphs. This paper summarizes some recent results on graph languages generated by edge replacement. In particular, we show that the languages are fixed points of their productions (considered as equations) and that they can be generated by language operations (substitution and iteration) from finite graph languages.

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

[2]  Manfred Nagl,et al.  A Tutorial and Bibliographical Survey on Graph Grammars , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

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

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

[5]  William A. Woods,et al.  Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .

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

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

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

[9]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

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

[11]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

[12]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

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

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

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

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

[17]  Richard S. Bird,et al.  Programs and Machines , 1976 .