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