An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata

Simple item page
dc.creatorHenckell, Karsten
dc.creatorRhodes, John
dc.creatorSteinberg, Benjamin
dc.date2008-12-18
dc.date.accessioned2026-07-07T12:20:17Z
dc.date.available2026-07-07T12:20:17Z
dc.descriptionThe question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, \textit{Complexity of finite semigroups}, Annals of Mathematics (2) \textbf{88} (1968), 128--160, motivated by the Prime Decomposition Theorem of K. Krohn and J. Rhodes, \textit{Algebraic theory of machines, {I}: {P}rime decomposition theorem for finite semigroups and machines}, Transactions of the American Mathematical Society \textbf{116} (1965), 450--464. Here we provide an effective lower bound for group complexity.
dc.identifierhttps://arxiv.org/abs/0812.3499
dc.identifierhttp://arxiv.org/abs/0812.3499
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/213025
dc.subjectGroup Theory
dc.subjectCombinatorics
dc.subject20M07
dc.titleAn Effective Lower Bound for Group Complexity of Finite Semigroups and Automata
dc.typetext

Files

Collections

arXiv