Automatic structures for semigroup constructions. (Q2481327)

Survey and reformulation of results about automatic semigroups, e.g., the direct product of automatic semigroups is automatic iff it is finitely generated and a Rees matix semigroup \(S=\mathcal M[U;I,J;P]\) is automatic, if \(U\) is automatic and \(I,J,U\setminus V\) are all finite, where \(V\) is the ideal of \(U\) generated by the entries of \(P\). It is shown that any Bruck-Reilly extension of a finite monoid \(T\) is automatic; if \(T\) is a finite semigroup, \(S\) is an automatic (infinite) semigroup, the diagonal \(S\)-act is not finitely generated and the wreath product \(S\text{\,wr\,}T\) is finitely generated, then \(S\text{\,wr\,}T\) is automatic.