Decidability of Krohn-Rhodes complexity $c=1$ 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…