On a consequence of the Krohn–Rhodes theorem

The Krohn–Rhodes theorem on the cascade connected automata was proved under the assumption that the basis contains special group automata. In this paper, we show that if the basis contains the constant automata, then this restriction can be omitted and for any simple group $G$ it is sufficient to take an arbitrary group automaton, whose group has $G$ as a divisor.