Skip to main content
SpringerLink
Log in

Minimization of logical schemes of algorithms

  • 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. Yu. I. Yanov, “On logical schemes of algorithms,” in: Problems of Cybernetics [in Russian], Fizmatgiz, Moscow (1958).

    Google Scholar 

  2. V. G. Lazarev and E. I. Piil', Synthesis of Control Automata [in Russian], Énergiya, Moscow (1970).

    Google Scholar 

  3. V. F. D'yachenko, “Transformation of logical schemes of algorithms,” in: Principles of Control Networks and System Design [in Russian], Nauka, Moscow (1964).

    Google Scholar 

  4. V. F. D'yachenko and M. Kegst, “Partitioning of a conversion formula system into independent subsystems” in: Automata and Control. Design of Communications Network Control Devices [in Russian], Nauka, Moscow (1977).

    Google Scholar 

Download references

Authors
  1. V. F. D'yachenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Kegst
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 46–52, November–December, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

D'yachenko, V.F., Kegst, M. Minimization of logical schemes of algorithms. Cybern Syst Anal 14, 851–859 (1978). https://doi.org/10.1007/BF01070278

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation