Skip to main content
Log in

Iterative procedures for factorizing elements of symmetric semigroups

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. V. M. Glushkov, “Completeness of systems of operations in electronic computers,” Kibernetika, No. 2 (1968).

  2. Yu. V. Kapitinova, “Estimation of the length of a microprogram in a certain microprogram algebra,” Kibernetika, No. 1 (1969).

  3. M. I. Kratko and G. S. Plesnevich, “A certain problem of V. M. Glushkov,” Kibernetika, No. 2 (1969).

  4. V. G. Bondarev, “An algorithm for factorization in finite symmetric semigroups,” Kibernetika, No. 4 (1970).

  5. Yu. V. Golunkov, “Complexity of representing permutations of symmetric semigroups by elements of a system of generators,” Kibernetika, No. 1 (1971).

  6. B. A. Pogorelov, “A certain problem of V. M. Glushkov,” Kibernetika, No. 5 (1973).

  7. Yu. V. Golunkov, “Some remarks on homogeneous tape structures,” Izv. Akad. Nauk SSSR, Tekh. Kibermetika, No. 6 (1972).

  8. V. P. Bityutskii, Design in Tape Structures [in Russian], Deposited Manuscript No. 3654-71.

Download references

Authors

Additional information

Translated from Kibernetika, No. 5, pp. 49–50, September–October, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bityutskii, V.P. Iterative procedures for factorizing elements of symmetric semigroups. Cybern Syst Anal 11, 720–721 (1975). https://doi.org/10.1007/BF01071361

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation