Proves that Krohn-Rhodes complexity c=1 is decidable for finite semigroups and automata via profinite methods and prior lower-bound results.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Decidability of Krohn-Rhodes complexity $c = 1$ of finite semigroups and automata
Proves that Krohn-Rhodes complexity c=1 is decidable for finite semigroups and automata via profinite methods and prior lower-bound results.