Reducible (control) flow graph
Reducible (control) flow graph --- сводимый управляющий граф.
Let be a cf-graph and let . The derived cf-graph of , denoted , is defined by the following rules: , and for any the cf-graph is derived from the cf-graph by reduction of its maximal interval into nodes. The limit cf-graph of is defined as its -derived cf-graph such that . is called (interval) reducible if its limit cf-graph is trivial and (interval) irreducible otherwise.