Complexity of Finite Semigroups: History and Decidability
| Autor: | Margolis, StuarT, Rhodes, John, Schilling, Anne |
|---|---|
| Rok vydání: | 2025 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | 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. 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. Comment: arXiv admin note: text overlap with arXiv:2410.06668 |
| Databáze: | arXiv |
| Externí odkaz: |
|