Skip to main content
SpringerLink
Log in

Some bounds for the measure of information redundancy of systems of generatrices of a symmetrical substitution group

  • 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. M. Glushkov, “Completeness of systems of operations in electronic computers,” Kibernetika, No. 2 (1968).

  2. Yu. V. Kapitonova, “On bounds for the length of a microprogram in a microprogram algebra,” Kibernetika, No. 1 (1969).

  3. M. N. Kratko and G. S. Plesnevich, “On a problem of V. M. Glushkov,” Kibernetika, No. 2 (1969).

  4. V. A. Ganov, “Upper bound of information redundancy measure of symmetrical semigroup,” Kibernetika, No. 6 (1970).

  5. Yu. V. Golunkov, “Complexity of representation of substitutions of symmetrical semigroup by elements of systems of generatrices,” Kibernetika, No. 1 (1971).

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

Download references

Authors
  1. V. A. Rubtsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 51–55, September–October, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rubtsov, V.A. Some bounds for the measure of information redundancy of systems of generatrices of a symmetrical substitution group. Cybern Syst Anal 11, 722–726 (1975). https://doi.org/10.1007/BF01071362

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation