2000 character limit reached
The Krohn-Rhodes Theorem and Local Divisors
Published 7 Nov 2011 in math.GR and cs.FL | (1111.1585v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.