Automaticity of semigroups of regular languages
Elena Khazova · Moscow University Mathematics Bulletin · 2007
It is proved that there exist semigroups of regular languages not possessing automatic structure of a certain special form and also that semigroups of regular languages over a one-letter alphabet are automatic.