Pages that link to "Item:Q2553689"

The following pages link to Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups (Q2553689):

Displaying 11 items.

• On the complexity of finite semigroups (Q1212108) (← links)
• Finite binary relations have no more complexity than finite functions (Q1212557) (← links)
• The kernel of a homomorphism on a finite semigroup (Q1215718) (← 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)
• Decomposition and complexity of finite semigroups (Q2549042) (← links)
• Improved lower bounds for the complexity of finite semigroups (Q2559565) (← links)
• An effective lower bound for group complexity of finite semigroups and automata (Q5389413) (← links)
• Complexity of ideals in finite semigroups and finite-state machines (Q5561972) (← links)
• The fundamental lemma of complexity for arbitrary finite semigroups (Q5577140) (← links)