Embedding theorems in the algebraic theory of graph grammars

Activity productions for graph grammars

“…(1) ~oR ~ CRITo = @ (2) color, h(z) = color, fi(x') for all :z,z' e R with rz = rz' (3) d~ff'f~_tRndo~K~ = ¢ Note: The theorem stated here is a special case of Ehrig's second embedding theorem. We assume d~# injective.…”

A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems

“…If d ′ is a restriction of a derivation d, then d can be considered as an extension of d ′ , and d ′ is embedded into a larger context. Extension and restriction are investigated in some detail by Ehrig [8], Kreowski [9,10], and Plump [11].…”