Complexity of finite semigroups

From MaRDI portal
Publication:2528390

DOI10.2307/1970558zbMath0162.03902OpenAlexW2325975656MaRDI QIDQ2528390

K. Krohn, John L. Rhodes

Publication date: 1968

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1970558




Related Items

Complexity of ideals in finite semigroups and finite-state machinesPointlike sets and separation: a personal perspectiveQuivers of monoids with basic algebrasON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICESPointlike sets for varieties determined by groupsThe fundamental lemma of complexity for arbitrary finite semigroupsOn calculating the Krohn-Rhodes decomposition of automataSome reducibility properties for pseudovarieties of the form DRHLower bounds for the \(\pi\)-length of (finite) \(\pi\)-solvable semigroupsExtensions of theorems of Gaschütz, Žmud\('\) and Rhodes on faithful representationsPseudovarieties of ordered completely regular semigroupsBireversible automata generating lamplighter groupsEffective dimension of finite semigroups.On the minimal faithful degree of Rhodes semisimple semigroupsIterated periodicity over finite aperiodic semigroupsOn an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties.Finite state automata: A geometric approachManaging complexity in industrial collaborationsUnions of groups of small heightAn effective lower bound for group complexity of finite semigroups and automataMODULESGroup-complexity and reversals of finite semigroupsDynamics of implicit operations and tameness of pseudovarieties of groupsOn the complexity of finite semigroupsA local structure theorem for stable, \(\mathcal{J}\)-simple semigroup biacts\(\pi\)-length of union of groups semigroupsThe Burnside problem for semigroupsProof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroupsKrohn-Rhodes complexity pseudovarieties are not finitely basedPro-aperiodic monoids via saturated modelsThe geometry of profinite graphs with applications to free groups and finite monoidsRepresentation theory of finite semigroups, semigroup radicals and formal language theoryAbelian Networks I. Foundations and ExamplesThe group-theoretic complexity of subsemigroups of Boolean matricesCascade connections and triangular products of linear automataON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPSOn a characterization of the nonregular set of primesOn the cohomology of finite semigroupsDecomposition and complexity of finite semigroupsCATEGORIES AS ALGEBRA, IIRepresentations of semigroups by linear transformations. IProfinite topologiesCOMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITYImproved lower bounds for the complexity of finite semigroupsLower bounds for complexity of finite semigroups