Skip to main content
SpringerLink
Log in

A problem of V. M. Glushkov

  • 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. V. G. Bondarev, “Algorithm of decomposition in finite symmetric semigroups,” Kibernetika,6, No. 4 (1970).

  2. V. M. Glushkov, “Completeness of a system of operations in digital computers,” Kibernetika,4, No. 2 (1968).

  3. Yu. V. Golunkov, “On complexity of representing permutations of symmetric semigroups in terms of the elements of the system of generators,” Kibernetika,7, No. 1 (1971).

  4. Yu. V. Kapitonova, “The problem of estimating the length of a microprogram in a microprogram algebra,” Kibernetika,5, No. 1 (1969).

Download references

Authors
  1. B. A. Pogorelov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 141–143, September–October, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pogorelov, B.A. A problem of V. M. Glushkov. Cybern Syst Anal 9, 895–899 (1973). https://doi.org/10.1007/BF01069732

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation