A CLASS OF SEMIGROUPS WITH A DECIDABLE WORD PROBLEM
G. U. ganesyan · 2005
The notion of a system of relations without left (or right) cycles (see [i, p. 40]) was introduced in [i]. In [2] was advanced the hypothesis on the decidability of the word and the left (right) divisibility problems in a semigroup, given by a system of defining relations without left (right) cycles, and a certain approach to the solution of these problems was indicated. Relying on the idea suggested in [2], we will prove the decidability of the indicated problems under an additional condition on the system of defining relations.