Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup
- First Online:
- Cite this article as:
- Abughazalah, N. Acta Math. Hungar. (2017) 151: 271. doi:10.1007/s10474-017-0687-5
- 32 Downloads
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.