Skip to main content
SpringerLink
Log in

Construction of an effective algorithm to find the isomorphism of two simple finite semigroups

  • 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. Algebraic Theory of Languages and Semigroups [in Russian], Statistika, Moscow (1975).

  2. V. M. Glushkov, “Abstract theory of automata,” Usp. Mat. Nauk,16, No. 5, 3–62 (1961).

    Google Scholar 

  3. S. Booth Kellog, “Isomorphism testing for graphs, semigroups, and finite automata are polynomially equivalent problems,” SIAM J. Comput.,7, No. 3, 297 (1978).

    Google Scholar 

  4. A. Clifford and G. Preston, Algebraic Theory of Semigroups [Russian translation], Mir, Moscow (1972).

    Google Scholar 

  5. V. A. Makarenko, Clarification of the Isomorphism of Finite 0-Simple and Simple Semigroups [in Russian], RFAP, Kiev (1977).

    Google Scholar 

  6. A. Aho, J. Hopcroft, and J. Ullman, Calculation and Analysis of Calculational Algorithms [Russian translation], Mir, Moscow.

  7. B. V. Gnedenko, Course in Probability Theory [in Russian], Gostekhizdat, Moscow (1954).

    Google Scholar 

Download references

Authors
  1. V. A. Makarenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 20–25, 30, November–December, 1986.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Makarenko, V.A. Construction of an effective algorithm to find the isomorphism of two simple finite semigroups. Cybern Syst Anal 22, 706–714 (1986). https://doi.org/10.1007/BF01068686

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation