Confluent NCE graph grammar

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

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

[math]\displaystyle{ \,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.