On Relationships between Graph L-Systems and Picture Languages: Part II

In this paper, a path controlled embedding graph grammar (PCE graph grammar) having the confluent property is proposed. Then it is extended to a parallel case, i.e., graph L-system. The generative powers of these systems are compared with that of context-free array grammars.

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

[2]  Akira Nakamura,et al.  On a Relationship between Graph L-Systems and Picture Languages , 1983, Theor. Comput. Sci..

[3]  Nalinakshi Nirmal,et al.  Filamentous systems with apical growth , 1983 .

[4]  Yasunori Yamamoto,et al.  Context-sensitivity of Two-Dimensional Regular Array Grammars , 1989, Int. J. Pattern Recognit. Artif. Intell..

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

[6]  Azriel Rosenfeld,et al.  Partial Path Groups and Parallel Graph Contractions , 1986 .

[7]  Robert A. Melter.  Tessellation graph characterization using rosettas , 1986, Pattern Recognit. Lett..

[8]  Akira Nakamura,et al.  Graph Grammars with Path-Controlled Embedding , 1991, Theor. Comput. Sci..

[9]  Joost Engelfriet,et al.  Context-Free NCE Graph Grammars , 1989, FCT.