Node Replacements in Embedding Normal Form

摘要

We introduce the embedding normal form for eNCE graph grammars to simplify the analysis of eNCE graph languages. Using this normal form we show that for a large class of eNCE graph grammars useless edges and blocking edges can be removed. This class of eNCE graph grammars can be characterized in terms of weak notions of order independency.