Formal Statement of Problem of Structuring Algorithms

Peculiarities of constructions of structural algorithmic are analyzed. Mathematical models ofboth individual constructions and structural algorithms as a whole are offered. A notion of factorization of an algorithm fragment and axiomatics of this operation are defined. Revealed features ofthe structural algorithms and a formal statement of a problem of structurization of a non-structural entity consist the basis for the automated solution to the problem of algorithm structurization.