Complexity of finite semigroups
From MaRDI portal
Publication:2528390
DOI10.2307/1970558zbMath0162.03902OpenAlexW2325975656MaRDI QIDQ2528390
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 machines ⋮ Pointlike sets and separation: a personal perspective ⋮ Quivers of monoids with basic algebras ⋮ ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES ⋮ Pointlike sets for varieties determined by groups ⋮ The fundamental lemma of complexity for arbitrary finite semigroups ⋮ On calculating the Krohn-Rhodes decomposition of automata ⋮ Some reducibility properties for pseudovarieties of the form DRH ⋮ Lower bounds for the \(\pi\)-length of (finite) \(\pi\)-solvable semigroups ⋮ Extensions of theorems of Gaschütz, Žmud\('\) and Rhodes on faithful representations ⋮ Pseudovarieties of ordered completely regular semigroups ⋮ Bireversible automata generating lamplighter groups ⋮ Effective dimension of finite semigroups. ⋮ On the minimal faithful degree of Rhodes semisimple semigroups ⋮ Iterated periodicity over finite aperiodic semigroups ⋮ On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. ⋮ Finite state automata: A geometric approach ⋮ Managing complexity in industrial collaborations ⋮ Unions of groups of small height ⋮ An effective lower bound for group complexity of finite semigroups and automata ⋮ MODULES ⋮ Group-complexity and reversals of finite semigroups ⋮ Dynamics of implicit operations and tameness of pseudovarieties of groups ⋮ On the complexity of finite semigroups ⋮ A local structure theorem for stable, \(\mathcal{J}\)-simple semigroup biacts ⋮ \(\pi\)-length of union of groups semigroups ⋮ The Burnside problem for semigroups ⋮ Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups ⋮ Krohn-Rhodes complexity pseudovarieties are not finitely based ⋮ Pro-aperiodic monoids via saturated models ⋮ The geometry of profinite graphs with applications to free groups and finite monoids ⋮ Representation theory of finite semigroups, semigroup radicals and formal language theory ⋮ Abelian Networks I. Foundations and Examples ⋮ The group-theoretic complexity of subsemigroups of Boolean matrices ⋮ Cascade connections and triangular products of linear automata ⋮ ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS ⋮ On a characterization of the nonregular set of primes ⋮ On the cohomology of finite semigroups ⋮ Decomposition and complexity of finite semigroups ⋮ CATEGORIES AS ALGEBRA, II ⋮ Representations of semigroups by linear transformations. I ⋮ Profinite topologies ⋮ COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY ⋮ Improved lower bounds for the complexity of finite semigroups ⋮ Lower bounds for complexity of finite semigroups
