Skip to main content
Log in

Overlapping algorithms

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

References

  1. A. A. Markov, Theory of Algorithms.Trudy Mat. Inst. Steklov. 42 (1954). (Translation: Office of Technical Services, U.S. Department of Commerce, Washington, D.C., 1961).

  2. A. P. Železnikar, A general theory of substitutional algorithms and its connection with digital automata (Slovenian). Nuclear Institute “J. Stefan,” Report P-196 (1966), 1–78.

  3. A. A. Ljapunov, On some general problems of cybernetics (Russian).Problemy Kibernet. 1 (1958), 5–22.

    Google Scholar 

  4. Ju. I. Janov, On logical schemes of algorithms (Russian).Problemy Kibernet. 1 (1958), 75–127.

    Google Scholar 

  5. M. Davis,Computability and Unsolvability, McGraw-Hill, New York, 1958.

    Google Scholar 

  6. A. P. Železnikar, Some algorithm theory and its applicability.Periodicum Math.-Phys. Astr. 18 (1963), 141–158.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Železnikar, A.P. Overlapping algorithms. Math. Systems Theory 1, 325–345 (1967). https://doi.org/10.1007/BF01695167

Download citation

  • Received:

  • Issue Date:

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

Keywords