Graph grammars with path-controlled embedding (Q1177180): Difference between revisions

A variant of node-replacement graph grammars is defined, called with path-controlled embedding, namely using a sequence of edges instead of a single edge in order to embed a newly replaced graph into a host graph. Such a graph grammar for generating the set of all rectangular grids which are generated by a NCE grammar with context-sensitive rules in the sense of \textit{D. Janssens} and \textit{G. Rozenberg} [Theor. Comput. Sci. 21, 55-74 (1982; Zbl 0486.68075)] is constructed; then the class of such path-controlled embedding graph grammars is characterized in terms of partial path groups [\textit{A. Rosenfeld}, Partial path groups and parallel graph contractions, The book of L, Springer-Verlag, 369-382 (1986; Zbl 0592.05021)].