Skip to main content
Log in

Structural models of algorithms in problems of applied programming. I. Formal algorithmic structures

  • Published:
Cybernetics and Systems Analysis Aims and scope

A structural approach to modelling algorithms is proposed. The concept of an algorithmic structure with operations over algorithms is introduced. Models of algorithms constructed from algorithmic structures reflect aspects of algorithm representation and execution. Examples of structural and path models of algorithms are considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. V. M. Glushkov, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5, 3–11 (1965).

    Google Scholar 

  2. V. M. Glushkov, G. E. Tsejtlin, and E. L. Yushchenko, Algebra, Languages, and Programming [in Russian], Naukova Dumka, Kiev (1989).

    Google Scholar 

  3. F. T. Andon, A. E. Doroshenko, G. E. Tseitlin, and E. A. Yatsenko, Algebro-Algorithmic Models and Methods of Parallel Programming [in Russian], Akademperiodika, Kiev (2007).

    Google Scholar 

  4. G. E. Tsejtlin, Tntroduction to Algorithmics [in Russian], Sfera, Kiev (1998).

    Google Scholar 

  5. A. A. Lyapunov, “Algebraic treatment of programming,” Probl. Kibern., No. 8, 235–243 (1962).

    Google Scholar 

  6. A. A. Lyapunov, “On logical schemes of programs,” Probl. Kibern., No. 1, 46–74 (1958).

    Google Scholar 

  7. Yu. T. Yanov, “Logical schemes of algorithms,” Probl. Kibern., No. 1, 75–127 (1958).

  8. G. E. Tseitlin, “Transformational reducibility and synthesis of algorithms and programs of symbolic processing,” Cybernetics and Systems Analysis, 42, No. 5, 750–757 (2006).

    Article  MATH  Google Scholar 

  9. P. Naudin and C. Quitti, Algebraic Algorithmics [Russian translation], Mir, Moscow (1999).

  10. B. Mishra, Algorithmic Algebra, Springer, N.Y. (1993).

    MATH  Google Scholar 

  11. N. Kutland, Computability: An Tntroduction to Recursive Function Theory [Russian translation], Mir, Moscow (1983).

  12. K. Kaspersky, Code Optimization: Effective Memory Usage [Russian translation], BHV-Peterburg, St. Petersburg (2003).

    Google Scholar 

  13. V. M. Tlman and V. T. Shinkarenko, “A structural approach to the grammar-recovery problem,” Probl. Progr., No. 1, 5–16 (2007).

    Google Scholar 

  14. R. Linger, H. Mills, and B. Witt, Structured Programming: Theory and Practice [Russian translation], Mir, Moscow (1982).

  15. D. E. Knuth, The Art of Computer Programming [Russian translation], Vol. 3, Sorting and Searching, Tzd. Dom “Williams,” Moscow (2000).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. I. Shynkarenko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 3–14, May-June 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shynkarenko, V.I., Ilman, V.M. & Skalozub, V.V. Structural models of algorithms in problems of applied programming. I. Formal algorithmic structures. Cybern Syst Anal 45, 329–339 (2009). https://doi.org/10.1007/s10559-009-9118-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-009-9118-0

Keywords

Navigation