Automatic structures for semigroup constructions.

DOI10.1007/S00233-007-9026-4MaRDI QIDQ2481327zbMATH OpenOpenAlexFDO

Publication date 9 April 2008

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0703190

automatic semigroups Bruck-Reilly extensions direct products free products wreath products

Free semigroups, generators and relations, word problems (20M05) General structure theory for semigroups (20M10) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix semigroups, Bruck-Reilly extensions and wreath products.

Review text

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.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: Automatic structures for semigroup constructions.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481327)