CAYLEY AUTOMATON SEMIGROUPS
Victor Maltcev · International Journal of Algebra and Computation · 2009
In this paper we characterize when a Cayley automaton semigroup is finite, is free, is a left zero semigroup, is a right zero semigroup, is a group, or is trivial. We also introduce dual Cayley automaton semigroups and discuss when they are finite.