2008/07/30 by Victor Maltcev, Maltcev, Victor
Computer Science · Mathematics · #semigroups and automata theory #Advanced Algebra and Logic #Geometric and Algebraic Topology
paper · pdf · doi:10.48550/arxiv.0807.4829
In this note we prove that, for a finite semigroup S, the dual Cayley automaton semigroup \mathbfC∗(S) is finite if and only if S is H-trivial and has no non-trivial right zero subsemigroups.