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.