The following pages link to Complexity of finite semigroups (Q2528390):
Displaying 45 items.
- Cascade connections and triangular products of linear automata (Q743574) (← links)
- Pointlike sets and separation: a personal perspective (Q832918) (← links)
- Unions of groups of small height (Q1172704) (← links)
- On the complexity of finite semigroups (Q1212108) (← links)
- \(\pi\)-length of union of groups semigroups (Q1215019) (← links)
- The Burnside problem for semigroups (Q1215588) (← links)
- Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups (Q1224177) (← links)
- The group-theoretic complexity of subsemigroups of Boolean matrices (Q1255585) (← links)
- On calculating the Krohn-Rhodes decomposition of automata (Q1366274) (← links)
- Lower bounds for the \(\pi\)-length of (finite) \(\pi\)-solvable semigroups (Q1393613) (← links)
- On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. (Q1421252) (← links)
- Effective dimension of finite semigroups. (Q1940207) (← links)
- A local structure theorem for stable, \(\mathcal{J}\)-simple semigroup biacts (Q2009660) (← links)
- Profinite topologies (Q2074218) (← links)
- Pro-aperiodic monoids via saturated models (Q2279939) (← links)
- Pseudovarieties of ordered completely regular semigroups (Q2422183) (← links)
- Iterated periodicity over finite aperiodic semigroups (Q2434750) (← links)
- On a characterization of the nonregular set of primes (Q2534175) (← links)
- On the cohomology of finite semigroups (Q2536788) (← links)
- Decomposition and complexity of finite semigroups (Q2549042) (← links)
- Representations of semigroups by linear transformations. I (Q2554795) (← links)
- Improved lower bounds for the complexity of finite semigroups (Q2559565) (← links)
- Lower bounds for complexity of finite semigroups (Q2560324) (← links)
- Pointlike sets for varieties determined by groups (Q2631933) (← links)
- Finite state automata: A geometric approach (Q2716145) (← links)
- Dynamics of implicit operations and tameness of pseudovarieties of groups (Q2750958) (← links)
- Abelian Networks I. Foundations and Examples (Q2804993) (← links)
- Quivers of monoids with basic algebras (Q3167321) (← links)
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS (Q3379492) (← links)
- MODULES (Q3561117) (← links)
- Representation theory of finite semigroups, semigroup radicals and formal language theory (Q3617621) (← links)
- Group-complexity and reversals of finite semigroups (Q4106789) (← links)
- The geometry of profinite graphs with applications to free groups and finite monoids (Q4433117) (← links)
- CATEGORIES AS ALGEBRA, II (Q4469599) (← links)
- Some reducibility properties for pseudovarieties of the form <i>DRH</i> (Q4567814) (← links)
- Krohn-Rhodes complexity pseudovarieties are not finitely based (Q4680740) (← links)
- ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES (Q5292274) (← links)
- Managing complexity in industrial collaborations (Q5385486) (← links)
- An effective lower bound for group complexity of finite semigroups and automata (Q5389413) (← links)
- COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY (Q5493859) (← links)
- Complexity of ideals in finite semigroups and finite-state machines (Q5561972) (← links)
- The fundamental lemma of complexity for arbitrary finite semigroups (Q5577140) (← links)
- Extensions of theorems of Gaschütz, Žmud\('\) and Rhodes on faithful representations (Q6070269) (← links)
- Bireversible automata generating lamplighter groups (Q6096764) (← links)
- On the minimal faithful degree of Rhodes semisimple semigroups (Q6170778) (← links)
