In expanding the known classical algebra algorithms received meaningful input operations elimination, introduced a new extension. At the level of innovation is the introduction of the alphabet in special unitermiv, what are the signs uniterm return cycle and conditional uniterm cycle. At the level of innovation definitions of operations is an axiom uniterma input and output in the region of the operation cyclic sequencing, axiom input and output uniterma in scope and with the operationcyclic elimination, input and output axioms uniterma in scope and operation cyclic paralleling.
1. Овсяк В.К. Засоби еквівалентних перетворень алгоритмів інформаційно-технологічних систем // Доповіді Національної академії наук України, № 9, 1996. – С.83 – 89. 2. Ovsyak V.K. Computation Models and Algebra of Algorithms. http://www.nbuv.gov.ua/Portal/natural/VNULP/ISM/ 2008_621/01.pdf 3. Turing A.M. On computable numbers, with an application to the Entscheidungsproblem // Proceedings of London Mathematical Society, series 2, vol. 42 (1936–1937), pp. 230-265; correction, ibidem, vol. 43, pp. 544– 546. Reprinted in [13 Davis M., pp. 155-222] and available online at http://www.abelard.org/turpap2/tp2- ie.asp. 4. Post E.L. Finite Combinatory Processes – Formulation 1 // Journal of Symbolic Logic, 1, pp. 103– 105, 1936. Reprinted in The Undecidable, pp. 289ff. 5. Kolmogorov A.N. On the concept of algorithm (in Russian). Uspekhi Mat. Nauk 8:4 (1953), pp. 175–176; translated into English in Uspensky V.A., Semenov A.L.: Algorithms: Main Ideas and Applications, Kluwer, 1993. 6. Schönhage A. Storage modification machines // SIAM Journal on Computing, 9 (1980), pp. 490–508. 7. Markov A.A. Theory of algorithms (in Russian). Editions of Academy of Sciences of the USSR, vol. 38, 1951, pp. 176–189; translated into English in American Mathematical Society Translations, 1960, series 2, 15, pp. 1–14. 8. Church A. An unsolvable problem of elementary number theory // American Journal of Mathematics, vol. 58 (1936), pp. 345–363. 9. Aho A.V, Hopcroft J.E, Ullman J.D. The design and analysis of computer algorithms. – Addison-Wesley Publishing Company, 1974. 10. Krinitski N.A. Algorithms around us (in Russian). Mir, Moscow, 1988; also translated to Spanish (Algoritmos a nuestro alrededor). 11. Uspensky V.A., Semenov A.L. Algorithms: Main Ideas and Applications. Kluwer, 1993. 12. Ovsyak V.K., Ovsyak O.V, Ovsyak J.V. Theory of Abstract Algorithms and Mathematical Modelling of Information Systems (in Polish), Opole University of Technology Press, Opole, Poland, 2005. – 275 p. 13. Owsiak W., Owsiak A. Rozszerzenie algebry algorytmów // Pomiary, automatyka, kontrola, № 2, 2010. – S.184–188. 14. Овсяк О.В. Моделювання транслятора структур даних електромеханічних схем друкарських машин / Автореф. дис. роб., к.т.н., спец. 01.05.02- математичне моделювання та обчислювальні методи. – Львів: Національний університет” Львівська політехніка”, 2002. – 18 с.