Skip to main content
SpringerLink
Log in

Automaton-regular microprograms

  • 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, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5 (1965).

  2. V. M. Glushkov and A. A. Letichevskii, “Theory of algorithms and discrete processors,” in: Advances in Information Sciences, Vol. 1, Plenum Press, New York (1969).

    Google Scholar 

  3. B. A. Trakhtenbrot,Complexity of Algorithms and Computations [in Russian], Novosibirsk (1967).

  4. L. A. Kaluzhnin, “On the algorithmization of mathematical problems,” in: Problems of Cybernetics [in Russian], Moscow (1959), Number 2.

  5. P. M. Ivanov, “Axiomatization of microprogramming algebra,” in: Engineering Cybernetics [in Russian], Vol. 5, Izd. IK Akad. Nauk USSR, Kiev (1970).

    Google Scholar 

Download references

Authors
  1. P. M. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 21–30, January–February, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ivanov, P.M. Automaton-regular microprograms. Cybern Syst Anal 9, 22–34 (1973). https://doi.org/10.1007/BF01068663

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation