Pages that link to "Item:Q5577140"
From MaRDI portal
The following pages link to The fundamental lemma of complexity for arbitrary finite semigroups (Q5577140):
Displayed 13 items.
- On the complexity of finite semigroups (Q1212108) (← links)
- Finite binary relations have no more complexity than finite functions (Q1212557) (← links)
- Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups (Q1224177) (← links)
- Kernel systems - a global study of homomorphisms on finite semigroups (Q1247497) (← links)
- The group-theoretic complexity of subsemigroups of Boolean matrices (Q1255585) (← links)
- John Rhodes and the theory of finite semigroups. (Q2447219) (← links)
- Decomposition and complexity of finite semigroups (Q2549042) (← links)
- Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups (Q2553689) (← links)
- Representations of semigroups by linear transformations. I (Q2554795) (← links)
- Improved lower bounds for the complexity of finite semigroups (Q2559565) (← links)
- Krohn-Rhodes complexity pseudovarieties are not finitely based (Q4680740) (← 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)