Просмотр кода страницы Reducible (control) flow graph

'''Reducible (control) flow graph'''   --- [[сводимый управляющий граф]]. 

Let <math>G</math> be a ''cf-graph'' and let <math>k\geq 0</math>.
The '''<math>k</math>derived''' cf-graph <math>G_k</math> of <math>G</math>, denoted <math>G_k=I_k(G)</math>, is defined
by the following rules: <math>G_0=G</math>, and for any <math>k>0</math> the cf-graph <math>G_k</math>
is derived from the cf-graph <math>G_{k-1}</math> by reduction of its maximal interval
into nodes. The '''limit''' cf-graph of <math>G</math> is defined as its <math>k</math>-derived cf-graph <math>G_k</math>
such that <math>G_k=I_{k+1}(G)</math>. <math>G</math> is called '''(interval) reducible''' if
its limit cf-graph is trivial and '''(interval) irreducible''' otherwise.

[[Категория: Сводимые и регуляризуемые графы]]