Abstract
We give here a short proof that each finite automaton can be built as a cascade of permutation automata and identity-reset automata.
Similar content being viewed by others
References
K. Krohn andJ. Rhodes, Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines.Trans. Amer. Math. Soc. 116 (1965), 450–464.
J. Hartmanis andR. E. Stearns,Algebraic Structure Theory of Sequential Machines, Prentice Hall, 1966.
A. H. Clifford andG. B. Preston,The Algebraic Theory of Semigroups, Amer. Math. Soc. Math. Surveys No. 7, Providence, R.I., 1961.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zeiger, P. Yet another proof of the cascade decomposition theorem for finite automata. Math. Systems Theory 1, 225–228 (1967). https://doi.org/10.1007/BF01703821
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01703821