@inbook{Maler2010,
Abstract = {The Krohn-Rhodes theorem states that any deterministic automaton is a homomorphic image of a cascade of very simple automata which realize either resets or permutations. Moreover, if the automaton is counter-free, only reset automata are needed. In this paper we give a very constructive proof of a variant of this theorem due to Eilenberg.},
Address = {Berlin, Heidelberg},
Author = {Maler, Oded},
BookTitle = {Time for Verification: Essays in Memory of Amir Pnueli},
Editor = {Manna, Zohar and Peled, Doron A.},
File = {On the Krohn-Rhodes Cascaded Decomposition Theorem - a - a - a - p.pdf},
ISBN = {978-3-642-13754-9},
Pages = {260--278},
Publisher = {Springer Berlin Heidelberg},
Title = {On the Krohn-Rhodes Cascaded Decomposition Theorem},
URL = {https://doi.org/10.1007/978-3-642-13754-9\_12},
Year = {2010},
bdsk-url-1 = {https://doi.org/10.1007/978-3-642-13754-9\_12},
date-added = {2018-11-15 18:24:53 +0100},
date-modified = {2018-11-15 18:24:53 +0100},
doi = {10.1007/978-3-642-13754-9_12}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A