Confluent NCE graph grammar: различия между версиями

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

An ''[[NCE graph grammar]]'' <math>\mathcal {G}</math> is '''confluent''' (C-NCE) if

for every [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math> derivable (see '' [[Derivation]]'') from the axiom of <math>\mathcal {G}</math>, all nonterminal [[node|nodes]] <math>\,u, v</math> in <math>\,G</math>, and all productions <math>\,(\phi(u),H,D), \; (\phi(v),J,F)</math> in <math>{\mathcal G}</math> we have:

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

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

 

 

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