Solution of the word problem for semigroups without cycles
We prove that in an arbitrary semigroup without cycles, the problem of divisibility and, therefore, the word problem is solvable.
math.GR↗
arXiv subjects
Publications and source records attributed to Ara Malkhasyan.
We prove that in an arbitrary semigroup without cycles, the problem of divisibility and, therefore, the word problem is solvable.