Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Arbib (ed.),Algebraic Theory of Machines, Languages, and Semigroups, Academic Press, New York, 1968.
M. Arbib,Theories of Abstract Automata, Prentice-Hall, Englewood Cliffs, N.J., 1968.
A. Ginzburg,Algebraic Theory of Automata, Academic Press, New York, 1968.
J. Hartmanis andR. E. Stearns,Algebraic Structure Theory of Sequential Machines, Prentice-Hall, Englewood Cliffs, N.J., 1966.
K. Krohn andJ. Rhodes, Algebraic theory of machines, I,Trans. Amer. Math. Soc. 116 (1965), 450–464.
A. R. Meyer, A note on star-free events,J. Assoc. Comput. Machinery 16 (1969), 220–225.
P. Zeiger, Yet another proof of the cascade decomposition theorem for finite automata,Math. Systems Theory 1 (1967), 225–288.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Meyer, A.R., Thompson, C. Remarks on algebraic decomposition of automata. Math. Systems Theory 3, 110–118 (1969). https://doi.org/10.1007/BF01746516
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01746516