| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4587848 | Journal of Algebra | 2008 | 12 Pages |
Abstract
We consider the automaticity of subsemigroups of free products of semigroups, proving that subsemigroups of free products, with all generators having length greater than one in the free product, are automatic. As a corollary, we show that if S is a free product of semigroups that are either finite or free, then any finitely generated subsemigroup of S is automatic. In particular, any finitely generated subsemigroup of a free product of finite or monogenic semigroups is automatic.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
