Remarks on algebraic decomposition of automata
- Cite this article as:
- Meyer, A.R. & Thompson, C. Math. Systems Theory (1969) 3: 110. doi:10.1007/BF01746516
- 34 Downloads
A version of the Krohn-Rhodes decomposition theorem for finite automata is proved in which capabilities as well as semigroups are preserved. Another elementary proof of the usual Krohn-Rhodes theorem is also presented.