Pages that link to "Item:Q1224177"
From MaRDI portal
The following pages link to Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups (Q1224177):
Displaying 8 items.
- On the complexity of finite semigroups (Q1212108) (← links)
- Finite binary relations have no more complexity than finite functions (Q1212557) (← links)
- Kernel systems - a global study of homomorphisms on finite semigroups (Q1247497) (← links)
- John Rhodes and the theory of finite semigroups. (Q2447219) (← links)
- Decomposition and complexity of finite semigroups (Q2549042) (← links)
- Improved lower bounds for the complexity of finite semigroups (Q2559565) (← links)
- Group-complexity and reversals of finite semigroups (Q4106789) (← links)
- An effective lower bound for group complexity of finite semigroups and automata (Q5389413) (← links)
