DECOMPOSITIONS OF FINITE AUTOMATA
Michael Yoeli · Defense Technical Information Center (DTIC) · 1963
The basic ideas of an algebraic decomposition theory of finite automata are presented. These ideas are generalized by also considering admissible decompositions (overlapping partitions) of finite automata. Further research is required in order to derive from the basic theory, presented in this report, efficient techniques for the synthesis of sequential machine networks. On the other hand, the extension of some of the results obtained in this report to abstract algebras in general might be of some interest.