Skip to main content
SpringerLink
Log in

The Problem of Functional Completeness of Metaalgebras of Regular Events

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A review of investigations on the development of algebraic foundations of algorithmics is given. Results connected with the solution of the problem of functional completeness of a Kleene algebra generalization are considered. These results reflect recent advances in the investigation of algorithmic metaalgebras associated with well-known methods of design of algorithms and programs.

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

Similar content being viewed by others

REFERENCES

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

    Google Scholar 

  2. G. E. Tseitlin, An Introduction to Algorithmics [in Russian], Sfera, Kiev (1998).

    Google Scholar 

  3. G. E. Tseitlin, “Functional completeness criteria in the Dijkstra algebra,” Kibern. Sist. Anal., No. 5, 28-39 (1995).

  4. G. E. Tseitlin, “Constructing the lattice of subalgebras of the Dijkstra algebra,” Kibern. Sist. Anal., No. 1, 27-45 (1997).

  5. G. E. Tseitlin, “Functional completeness in iterative metaalgebras,” Kibern. Sist. Anal., No. 2, 12-27 (1998).

  6. E. L. Yushchenko and G. E. Tseitlin, “Issues of algorithmics and Glushkov's system of algorithmic algebras,” Kibern. Sist. Anal., No. 4, 67-77 (1998).

  7. E. L. Post, “The two-terminal iterative systems of mathematical logic,” Ann. Math. Studies, 5, No. 5 (1941).

    Google Scholar 

  8. S. V. Yablonskii, G. P. Gavrilov, and B. V. Kudryavtsev, Functions of the Algebra of Logic and Post Classes [in Russian], Nauka, Moscow (1966).

    Google Scholar 

  9. L. A. Kaluzhnin, “On algorithmization of mathematical problems,” Probl. Kibern., No. 2, 51-69 (1959).

  10. G. E. Tseitlin and E. L. Yushchenko, “Algebra of algorithms and Kaluzhnin's flowgraph,” Kibern. Sist. Anal., No. 2, 3-16 (1994).

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

  12. O. J. Dahl, E. W. Dijkstra, and C. R. Hoare, Structured Programming, Academic Press, New York (1972).

    Google Scholar 

  13. C. R. Hoare, “Data structures,” Current Trends in Programming Methodology, No. 4, 1-11 (1978).

  14. N. Wirth, Algorithms+Data Structures=Programs, Prentice Hall, Englewood Cliffs (1976).

    Google Scholar 

  15. A. I. Mal'tsev, “Iterative algebras and Post varieties,” in: Izbr. Tr. A. I. Mal'tseva, Vol. 2 (1976), pp. 316-330.

    Google Scholar 

  16. S. V. Yablonskii, “Functional constructions in k-valued logic,” Tr. MIAN USSR, No. 51, 5-142 (1958).

  17. P. Cohn, Universal Algebra [Russian translation], Mir, Moscow (1968).

    Google Scholar 

  18. G. O. Tseitlin, Algebra of Logic and Program Design: Elements of Discrete Mathematics [in Ukrainian], Naukova Dumka, Kyiv (1994).

    Google Scholar 

  19. R. R. Stoll, Sets, Logic, and Axiomatic Theories [Russian translation], Prosveshcheniye, Moscow (1968).

    Google Scholar 

  20. I. P. Vinnichuk, “Algebra of algorithmics and design of systems for synthesis of multimedia applications in the WINDOWS environment,” Kibern. Sist. Anal., No. 2, 34-43 (1999).

  21. G. Ye. Tseitlin, “Algebraic fundamentals of algorithmics and their application,” in: Proc. Conf. on Comp. Eng. and Inform. (Slovakia), Kosice (1999), pp. 2-6.

  22. V. N. Red'ko, “A collection of defining relations in an algebra of regular events,” Ukr. Mat. Zh., 16, No. 1, 120-126 (1964).

    Google Scholar 

  23. A. Salomaa, “Axiomatization of an algebra of events realizable by logical networks,” Probl. Kibern., No. 17, 237-246 (1966).

    Google Scholar 

  24. B. A. Trakhtenbrot and Ya. M. Barzdin', Finite Automata: Behavior and Synthesis [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  25. S. C. Kleene, “Representation of events in nerve nets,” in: Automata Studies [Russian translation], Inostr. Lit., Moscow (1956), pp. 15-67.

    Google Scholar 

  26. G. E. Tseitlin, “Infinitely generated subalgebras of a modified Post algebra,” Kibernetika, No. 2, 43-45 (1971).

  27. Yu. I. Yanov and A. A. Muchnik, “On existence of k-valued closed classes without a finite basis,” Dokl. Akad. Nauk SSSR, 127, No. 1, 44-46 (1959).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Solomon University, Kiev, Ukraine

    G. E. Tseitlin

Authors
  1. G. E. Tseitlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseitlin, G.E. The Problem of Functional Completeness of Metaalgebras of Regular Events. Cybernetics and Systems Analysis 36, 802–812 (2000). https://doi.org/10.1023/A:1009497008248

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009497008248

Search

Navigation