Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup
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 phrasessemigroup decidability word problem membership problem
Mathematics Subject Classification20M05
Unable to display preview. Download preview PDF.
- 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.P. A. Grillet, Semigroups, Marcel Dekker (New York, 1995).Google Scholar
- 7.J. M. Howie, Fundamentals of Semigroup Theory, Clarendon Press (Oxford, 1995).Google Scholar