Some results on the decomposition of finite automata

The purpose of this paper is to show that the endomorphism semigroup of a finite automaton may be useful in obtaining an iterative decomposition, i.e., a decomposition whose component automata are isomorphic. The technique of obtaining the above mentioned decompositions is a generalization of the method of “generating≓ decompositions using automorphism groups, presented by Jump Inform. Contr. 15, 424435 (1969)