1 citations · 2 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.DS2024
Aperiodic Flows on Finite Semigroups: Foundations and First Examples
Stuart Margolis, John Rhodes
The theory of flows was used as a crucial tool in the recent proof by Margolis, Rhodes and Schilling that Krohn-Rhodes complexity is decidable. In this paper we begin a systematic…
math.GR2024★ 1 cited
Decidability of Krohn-Rhodes complexity for all finite semigroups and automata
Stuart Margolis, John Rhodes, Anne Schilling
The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups tha…