Просмотр кода страницы Graph rewriting system (with priorities)

'''Graph rewriting system (with priorities)''' --- система
переписывания графов (с приоритетами). 

Let <math>C = (C_{V},C_{E})</math> be a color alphabet. A rewriting rule over <math>C</math>
consists of a connected <math>C</math>-labeled digraph <math>D</math> and a partial labeling
function of <math>D</math> denoted by <math>\lambda</math>. We write <math>r =
(D,\lambda)</math>. Note that such a rewriting rule can be more classically
viewed as a pair of graphs (the left-hand-side and the right-hand-side
of the rule) given by <math>(D, \lambda D)</math>.

A '''graph rewriting system''' with priorities is defined by a triple <math>(C,P,>)</math>, where:

(1) <math>C = (C_{V}, C_{E})</math> is the color alphabet,

(2) <math>P</math> is a finite set of rewriting rules over <math>C</math>,

(3) <math>></math> is a '' partial order'' on the rules of <math>P</math>.