Skip to main content
Log in

A class of semigroups with a decidable word problem

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

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. S. I. Adyan, “Defining relations and algorithmic problems for groups and semigroups,” Tr. Mat. Inst., Akad. Nauk SSSR,85 (1966).

  2. S. I. Adyan, “On transformations of words in a semigroup, given by a system of defining relations,” Algebra Logika,15, No. 6, 611–621 (1976).

    Google Scholar 

  3. S. I. Adyan and G. U. Oganesyan, “On the word and the divisibility problems in semigroups with one defining relation,” Izv. Akad. Nauk SSSR, Ser. Mat.,42, No. 2, 219–225 (1978).

    Google Scholar 

  4. O. A. Sarkisyan, “On the connection between algorithmic problems in groups and semigroups,” Dokl. Akad. Nauk SSSR,227, No. 6, 1305–1307 (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Matematicheskie Zametki, Vol. 24, No. 2, pp. 259–265, August, 1978.

The author expresses deep gratitude to S. I. Adyan, under whose guidance the present note has been prepared.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Oganesyan, G.U. A class of semigroups with a decidable word problem. Mathematical Notes of the Academy of Sciences of the USSR 24, 640–643 (1978). https://doi.org/10.1007/BF01105319

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation