On structured graph grammars. II

Abstract In paper I we introduced a framework of sequential graph rewriting and demonstrated how various existing approaches fit into it. In this paper we take a closer look at various basic features of this framework.

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

[2]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[3]  A. J. Kfoury,et al.  A Programming Approach to Computability , 1982, Texts and Monographs in Computer Science.

[4]  Azriel Rosenfeld,et al.  Web Grammars , 1969, IJCAI.

[5]  Manfred Nagl Graph-Grammatiken: Theorie, Anwendungen, Implementierung , 1979 .

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

[7]  Grzegorz Rozenberg,et al.  Hypergraph Systems and Their Extensions , 1983, RAIRO Theor. Informatics Appl..

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