Optimisation of Algorithms by Methods of Algebraic Automata Theory. Part II

The approach to the optimisation, grounded on the algebraic automata theory, using equivalent conversions of the formular expressions presenting a logiko-functional structure of algorithms, dealing with is formal-logic objects is observed. The number of instances from the standard concepts in mathematical cybernetics is resulted.