Skip to main content
SpringerLink
Log in

Problem of identity transformations of schemes of structured programs with closed logical conditions. I

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. V. M. Glushkov, “Automata theory and formal transformations of microprograms,” Kibernetika, No. 5. (1965).

  2. V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers,” in: Selected Aspects of Algebra and Logic [in Russian], Nauka, Novosibirsk (1973).

    Google Scholar 

  3. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra. Languages. Programming [in Russian], Naukova Dumka, Kiev (1974).

    Google Scholar 

  4. V. M. Glushkov (Gluscow), M. V. Ignat'ev (Ignatiev), V. A. Museshnikov (Mucesnikov), and V. A. Torgachev, “Recursive machines and computing technology,” IFIP Congress, Stockholm (1974).

  5. W. Dahl, E. Dijkstra, and K. Hoop, Structured Programming [Russian translation], Mir, Moscow (1975).

    Google Scholar 

  6. A. P. Ershov, “On Yanov's operator schemes,” in: Problems in Cybernetics [in Russian], No. 20, Nauka, Moscow (1967).

    Google Scholar 

  7. É. V. Evreinov and Yu. G. Kosarev, Homogeneous Universal Computational Systems of High Execution Rate [in Russian], Nauka, Novosibirsk (1966).

    Google Scholar 

  8. Yu. I. Zhuravlev, “Set-theoretical methods in logical algebra,” in: Problems in Cybernetics [in Russian], No. 8, Fizmatgiz, Moscow (1962).

    Google Scholar 

  9. G. M. Kirsanov and G. E. Tseitlin, “Some questions on the completeness of axiomatic systems in algorithmic algebras,” Kibernetika, No. 4 (1977).

  10. G. M. Kirsanov, G. E. Tseitlin, and E. L. Yushchenko, “On the automation of deductive derivations in a system of algorithmic algebras,” in: Languages of System Programming and Methods for Realizing Them [in Russian], Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1974).

    Google Scholar 

  11. G. M. Kirsanov, G. E. Tseitlin, and E. L. Yushchenko, “On the application of microprogram algebras to certain questions in the automation of programming,” in: Electronic Computer Software [in Russian], Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1971).

    Google Scholar 

  12. N. A. Krinitskii, Equipotent Transformations of Algorithms and Programs [in Russian], Sovet-skoe Radio, Moscow (1970).

    Google Scholar 

  13. A. A. Letichevskii, “On speeding up the iteration of monotone operators,” Kibernetika, No. 4 (1976).

  14. É. Z. Lyubimskii, “Capabilities and construction principles of an operational system on the BÉSM-6,” Author's Abstract of Doctoral Dissertation, Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1972).

    Google Scholar 

  15. D. A. Pospelov, Introduction to the Theory of Computing Systems [in Russian], Sovet-skoe Radio, Moscow (1972).

    Google Scholar 

  16. V. N. Red'ko, “Problems of constructing multilingual processors,” Reports of the All-Union Symposium on Methods of Realizing New Algorithmic Languages [in Russian], Novosibirsk (1975).

  17. G. E. Tseitlin, “Formal transformations in the algorithmic algebra of conditions,” Preprint 73-25, Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1973).

    Google Scholar 

  18. G. E. Tseitlin, “Canonic representations of logical conditions in a system of algorithmic algebras,” in: Programming Languages and Methods for Realizing Them [in Russian], Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1973).

    Google Scholar 

  19. G. E. Tseitlin, “Axiomatization of systems of algorithmic algebras with closed logical conditions,” Theses of the Fourth All-Union Conference on Mathematical Logic [in Russian], Shtiintsa, Kishinev (1976).

    Google Scholar 

  20. G. E. Tseitlin, “System of algorithmic algebras and some control schemes in homogeneous structures,” in: Aspects of the Theory and Construction of Computing Systems (Computing Systems) [in Russian], Novosibirsk (1977).

  21. G. E. Tseitlin and E. L. Yushchenko, “Representation of languages in bobsled (BS) automata,” Kibernetika, No. 6 (1974).

  22. E. L. Yushchenko, Address Programming [in Russian], Tekhnika, Kiev (1963).

    Google Scholar 

  23. Yu. L. Vasil'ev, F. Ya. Vetukhnovskii, V. V. Glagolev, Yu. I. Zhuravlev, V. I. Levenshtein, and S. V. Yablonskii, Discrete Mathematics and the Mathematical Aspects of Cybernetics [in Russian], Nauka, Moscow (1974).

    Google Scholar 

  24. Yu. I. Yanov, “On the logical schemes of algorithms,” in: Problems in Cybernetics [in Russian], No. 1, Nauka, Moscow (1958).

    Google Scholar 

  25. D. Scott, Outline of a Mathematical Theory of Computation, Technical Monograph PRG-2, Oxford Univ. (1970).

  26. M. B. Trakhtenbrot, “Degrees of parallelism for invariant functions,” in: Problems of Programming [in Russian], Vychisl. Tsentr. Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1976).

    Google Scholar 

Download references

Authors
  1. G. E. Tseitlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 50–57, May–June, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseitlin, G.E. Problem of identity transformations of schemes of structured programs with closed logical conditions. I. Cybern Syst Anal 14, 370–378 (1978). https://doi.org/10.1007/BF01074668

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01074668

Keywords

Search

Navigation