Author:
Campbell C. M.,Robertson E. F.,Ruškuc N.,Thomas R. M.
Abstract
AbstractIt is known that the direct product of two automatic groups is automatic. The notion of automaticity bas been extended to semigroups, and this for groups has been generalized to automatic monoids. However, the direct product of two automatic semigroups need not be finitely generated and hence not automatic.Robertson, Ruškuc and Wiegold have determined necessary and sufficient conditions for the direct product of two finitely generated semigroups to be finitely generated. Building on this, we prove the following. Let S and T be automatic semigroups; if S and T are infinite, then S × T is automatic if and only if S2 = S and T2 = T; if S is finite and T is infinite, then S × T is automatic if and only if S2 = S. As a consequence, we have that, if S and T are automatic semigroups, then S × T is automatic if and only if S × T is finitely generated.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Statistics and Probability
Reference6 articles.
1. Generators and relations of direct products of semigroups
2. Automatic groups and amalgams
3. [2] Campbell C. M. , Robertson E. F. , Ruškuc N. and Thomas R. M. , ‘Automatic semigroups’, Theoret Comput. Sci., to appear.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Automatic structure for generalized Bruck-Reilly ∗-extension of a monoid;Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics;2019-07-01
2. Automaticity of One-Relator Semigroups with Length Less Than or Equal to Three;Mathematics in Computer Science;2017-03
3. Markov semigroups, monoids and groups;International Journal of Algebra and Computation;2014-08
4. Automatic semigroups and Bruck-Reilly extensions;Acta Mathematica Hungarica;2009-11-06
5. Automatic subsemigroups of free products;Journal of Algebra;2008-02