A complete rewrite system and normal forms for \((S)_{\text{reg}}\) (Q1849635)

Let \(S\) be a semigroup and denote by \(\widehat S\) its left-right-iterated Rhodes expansion. \textit{J.-C. Birget} [J. Pure Appl. Algebra 34, 1-55 (1984; Zbl 0547.20054)] has previously shown that \(\widehat S\) is unambiguous, in the sense that the \(\mathcal L\)-order and \(\mathcal R\)-order are forests, and that every unambiguous semigroup \(T\) embeds into a regular semigroup \((T)_{\text{reg}}\) in such a way that \((\widehat S)_{\text{reg}}\) is finite in case \(S\) is finite, its subgroups divide those of \(S\), and several other nice properties are shared with \(S\) which afford many applications [ibid. 34, 57-115 (1984; Zbl 0547.20055)]. The construction of \((S)_{\text{reg}}\) is achieved by taking the elements of \(S\) and their formal inverses as generators and imposing suitable relations. The difficulty lies in establishing a normal form for the resulting presentation. In the present paper, a new proof of the normal form theorem is obtained by describing another presentation of \((S)_{\text{reg}}\) given by a complete string rewrite system which is then shown to be terminating and confluent.