Skip to main content
Complexity of Finite Semigroups: History and Decidability
Published Web Location
https://doi.org/10.1007/s00233-025-10560-zAbstract
Margolis, Rhodes and Schilling recently submitted two papers that proved that the complexity of a finite semigroup is computable. The purpose of this paper is to survey the basic results of Krohn–Rhodes complexity of finite semigroups and to outline the proof of its computability.
Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.