A note on automatic semigroups. (Q1955595)

Let \(S\) be a semigroup generated by a finite set \(A\) and \(L\) a regular language over \(A\). The pair \((A,L)\) is said to be an automatic structure for \(S\) if some conditions are fulfilled. If a semigroup \(S\) has an automatic structure then \(S\) is called automatic. It is known that this property does not depend on the choice of the semigroup generating set for monoids and completely simple semigroups. The author extends these results. The main theorem says that if a semigroup \(S\) satisfies the equality \(SS=S\) then if \(S\) is automatic with respect to a finite generating set then it is automatic with respect to any other finite generating set. Thus, for instance, regular semigroups have the same property.