1 citations · 1 across the 2 of their papers we have counts for
Showing math.GRShow all
2 papers · 1 filter
math.GR2025
Complexity of Finite Semigroups: History and Decidability
StuarT Margolis, John Rhodes, Anne Schilling
In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. Th…
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…