Skip to main content
Log in

An efficient algorithm for constructing the basis of a subgroup of a free group

  • 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. A. A. Letichevskii, “An approach to program analysis,” Kibernetika, No. 6, 1–8 (1979).

    Google Scholar 

  2. Computations in Algebra and in Theory of Numbers [Russian translation], Mir, Moscow (1976).

  3. W. Magnus, A. Karrass, and D. Solitar, Combinatorial Group Theory, Wiley, New York (1966).

    Google Scholar 

  4. V. M. Glushkov, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5, 1–9 (1965).

    Google Scholar 

  5. A. A. Letichevskii, “Speeding up iteration of monotone operators,” Kibernetika, No. 4, 1–7 (1976).

    Google Scholar 

  6. A. A. Letichevskii and A. B. Godlevskii, “Algorithm optimization in the design process by the method of formalized technical specifications,” in: Automatic Design of Computers and Their Components [in Russian], Kiev (1977), pp. 46–71.

  7. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “On application of the method of formalized technical specifications to the design of data structure manipulating programs,” Programmirovanie, No. 6, 31–43 (1978).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 3, pp. 107–116, May–June, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Letichevskii, A.A., Godlevskii, A.B. & Krivoi, S.L. An efficient algorithm for constructing the basis of a subgroup of a free group. Cybern Syst Anal 17, 407–416 (1981). https://doi.org/10.1007/BF01068987

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation