Skip to main content
SpringerLink
Log in

An algorithm to construct the basis of the intersection of finitely generated free groups

  • 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. G. Howson, “On the intersection of finitely generated free groups,” J. London Math. Soc., No. 29, 428–434 (1954).

    Google Scholar 

  2. A. V. Anisimov, “Languages of free groups,” Lect. Notes Comput. Sci., No., 32, 167–171 (1975).

    Google Scholar 

  3. A. A. Letichevskii, “An approach to program analysis,” Kibernetika, No. 6, 1–8 (1979).

    Google Scholar 

  4. W. Magnus, A. Karras, and D. Solitar, Combinatorial Group Theory, Wiley-Interscience New York (1966).

    Google Scholar 

  5. A. A. Letichevskii, A. B. Godlevskii, and S. L. Krivoi, “An efficient algorithm, for constructing the basis of a subgroup of a free group,” Kibernetika, No. 3, 107–116 (1981).

    Google Scholar 

  6. V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

Download references

Authors
  1. S. L. Krivoi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 5–10, July–August, 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krivoi, S.L. An algorithm to construct the basis of the intersection of finitely generated free groups. Cybern Syst Anal 18, 407–415 (1982). https://doi.org/10.1007/BF01078667

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation