most citedDecidability of Krohn-Rhodes complexity of finite semigroups and automata

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

math.GR2026★ 1 cited

Decidability of Krohn-Rhodes complexity of finite semigroups and automata

Stuart Margolis, John Rhodes, Anne Schilling

When decomposing a finite semigroup into a wreath product of groups and aperiodic semigroups, complexity measures the minimal number of groups that are needed. Determining an algor…