Acta Mathematica Hungarica

, Volume 151, Issue 2, pp 271–281 | Cite as

Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup

Article

Abstract

Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) has soluble word problem and soluble membership problem. Efficient algorithms are given for both problems.

Key words and phrases

semigroup decidability word problem membership problem 

Mathematics Subject Classification

20M05 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abughazalah N., Ruškuc N.: On disjoint unions of finitely many copies of the free monogenic semigroup. Semigroup Forum 87, 243–256 (2013)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Abughazalah N., Mitchell J.D., Péresse Y., Ruškuc N.: A classification of disjoint unions of two or three free monogenic semigroup. Semigroup Forum 91, 53–61 (2015)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Araújo I.M., Branco M.J.J., Fernandes V.H., Gomes G.M.S., Ruškuc N.: On generators and relations for unions of semigroups. Semigroup Forum 63, 49–62 (2001)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    E. A. Golubov. Finitely approximable regular semigroups, Mat. Zametki, 17 (1975), 423–432 (in Russian); English translation in Math. Notes, 17 (1975), 247–251.Google Scholar
  5. 5.
    P. A. Grillet, Semigroups, Marcel Dekker (New York, 1995).Google Scholar
  6. 6.
    Higgins J.:: Subsemigroups of the additive positive integers. Fibonacci Quart. 10, 225–230 (1972)MathSciNetMATHGoogle Scholar
  7. 7.
    J. M. Howie, Fundamentals of Semigroup Theory, Clarendon Press (Oxford, 1995).Google Scholar

Copyright information

© Akadémiai Kiadó, Budapest, Hungary 2017

Authors and Affiliations

  1. 1.Department of Mathematical SciencesPrincess Nourah bint Abdulrahman UniversityRiyadhSaudi Arabia

Personalised recommendations