Confluent NCE graph grammar

Confluent NCE graph grammar — конфлуентная графовая грамматика типа NCE.

An NCE graph grammar $\mathcal {G}$ is confluent (C-NCE) if for every graph $\,G$ derivable (see Derivation) from the axiom of $\mathcal {G}$, all nonterminal nodes $\,u, v$ in $\,G$, and all productions $\,(\phi(u),H,D), \; (\phi(v),J,F)$ in ${\mathcal G}$ we have:

$\,G[u/_{D} H][v/_{F} J] = G[v/_{F} J][u/_{D} H].$

In the confluent graph grammar, the order in which the productions are applied is irrelevant for the resulting graph.

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.