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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have