Skip to main content
SpringerLink
Log in

Algorithm for optimal choice in the microprogrammed synthesis of operations

  • Brief Communications
  • 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. G. V. Kantariya, “Certain questions of synthesis from the point of view of general systems theory,” Soobshch. Akad. Nauk GSSR,51, No. 1 (1968).

  2. G. V. Kantariya, “On one method of microprogram synthesis of operations,” Soobshch. Akad. Nauk GSSR,51, No. 2 (1968).

  3. I. A. Chegis and S. V. Yablonskii, “Logical methods of monitoring the operation of electrical circuits,” Proceedings of the V. A. Steklov Mathematical Institute, Vol. 51 [in Russian], Moscow (1958).

  4. N. A. Solov'ev, “Unconditional tests for a certain class of tables,” in: Systems Theory Research, Consultants Bureau, New York (1968), p. 42.

    Google Scholar 

  5. N. P. Sokolov, Spatial Matrices and Their Uses [in Russian], Fizmatgiz, Moscow (1960).

    Google Scholar 

Download references

Authors
  1. G. V. Kantariya
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 143–144, March–April, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kantariya, G.V. Algorithm for optimal choice in the microprogrammed synthesis of operations. Cybern Syst Anal 9, 355–357 (1973). https://doi.org/10.1007/BF01069096

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation