2000 character limit reached
The Krohn-Rhodes Theorem and Local Divisors (1111.1585v1)
Published 7 Nov 2011 in math.GR and cs.FL
Abstract: We give a new proof of the Krohn-Rhodes Theorem using local divisors. The proof provides nearly as good a decomposition in terms of size as the holonomy decomposition of Eilenberg, avoids induction on the size of the state set, and works exclusively with monoids with the base case of the induction being that of a group.