Skip to main content
SpringerLink
Log in

Abstract-automaton completeness in the class of many-place operators

  • 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, 1–9 (1965).

    Google Scholar 

  2. M. A. Khvostantsev, “Microprocessor homogeneous system,” Authors Abstract of Candidate's Dissertation, Moscow (1977).

  3. E. V. Evreinov and Yu. G. Kosarev, High-Throughput Homogeneous Universal Computing Systems [in Russian], Nauka, Novosibirsk (1966).

    Google Scholar 

  4. V. M. Glushkov, “On completeness of the operation set in computers,” Kibernetika, No. 2, 1–5 (1968).

    Google Scholar 

  5. Yu. V. Golunkov, “Algorithmic completeness and complexity of microprograms,” Kibernetika, No. 3, 1–15 (1977).

    Google Scholar 

  6. Ya. M. Barzdin', “On a class of Turing machines),” in: Proc. of the Seminar “Algebra and Logic” [in Russian], Vol. 1, No. 6, Moscow (1962), pp. 42–51.

Download references

Authors
  1. M. F. Zuev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. A. Khvostantsev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 13–16, November–December, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zuev, M.F., Khvostantsev, M.A. Abstract-automaton completeness in the class of many-place operators. Cybern Syst Anal 17, 731–735 (1981). https://doi.org/10.1007/BF01069219

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation