Skip to main content
SpringerLink
Log in

Yanov operator schemata with a finite equivalence relation

  • 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. A. P. Ershov, “Operator algorithms, Part III (On the operator schemata of Yanov),” in: Problems in Cybernetics [in Russian], No. 20, Izd. Nauka, Moscow (1968).

    Google Scholar 

  2. Yu. I. Yanov, “Logical schemata of algorithms,” in: Problems of Cybernetics [in Russian], No. 1, Fizmatgiz, Moscow (1958).

    Google Scholar 

Download references

Authors
  1. É. L. Gorel'
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Computing Center, Siberian Branch, Academy of Sciences of the USSR, Novosibirsk. Translated from Kibernetika, No. 5, pp. 63–64, September–October, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gorel', É.L. Yanov operator schemata with a finite equivalence relation. Cybern Syst Anal 7, 829–830 (1971). https://doi.org/10.1007/BF01641502

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation