Complexity of Finite Semigroups: History and Decidability

Stuart Margolis; John Rhodes; Anne Schilling

doi:10.1007/s00233-025-10560-z

Complexity of Finite Semigroups: History and Decidability

Stuart Margolis
, John Rhodes
, Anne Schilling

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	331-350
Number of pages	20
Journal	Semigroup Forum
Volume	111
Issue number	2
DOIs	https://doi.org/10.1007/s00233-025-10560-z
State	Published - Oct 2025

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

Keywords

Flows on automata
Krohn–Rhodes complexity
The Krohn–Rhodes Theorem

Access to Document

10.1007/s00233-025-10560-z

Cite this

@article{2cc83e3778ff4433add5329638d05874,

title = "Complexity of Finite Semigroups: History and Decidability",

abstract = "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.",

keywords = "Flows on automata, Krohn–Rhodes complexity, The Krohn–Rhodes Theorem",

author = "Stuart Margolis and John Rhodes and Anne Schilling",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.",

year = "2025",

month = oct,

doi = "10.1007/s00233-025-10560-z",

language = "אנגלית",

volume = "111",

pages = "331--350",

journal = "Semigroup Forum",

issn = "0037-1912",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Complexity of Finite Semigroups

T2 - History and Decidability

AU - Margolis, Stuart

AU - Rhodes, John

AU - Schilling, Anne

N1 - Publisher Copyright: © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

PY - 2025/10

Y1 - 2025/10

N2 - 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.

AB - 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.

KW - Flows on automata

KW - Krohn–Rhodes complexity

KW - The Krohn–Rhodes Theorem

UR - https://www.scopus.com/pages/publications/105012176754

U2 - 10.1007/s00233-025-10560-z

DO - 10.1007/s00233-025-10560-z

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:105012176754

SN - 0037-1912

VL - 111

SP - 331

EP - 350

JO - Semigroup Forum

JF - Semigroup Forum

IS - 2

ER -

Complexity of Finite Semigroups: History and Decidability

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this