Pages that link to "Item:Q2560324"

The following pages link to Lower bounds for complexity of finite semigroups (Q2560324):

Displaying 21 items.

• Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids (Q1204565) (← links)
• Finite binary relations have no more complexity than finite functions (Q1212557) (← links)
• Zig-zag representations and inverse semigroups (Q1214513) (← links)
• \(\pi\)-length of union of groups semigroups (Q1215019) (← links)
• Kernel systems - a global study of homomorphisms on finite semigroups (Q1247497) (← links)
• The complexity of economic decision rules (Q1251974) (← links)
• The group-theoretic complexity of subsemigroups of Boolean matrices (Q1255585) (← links)
• Lower bounds for the \(\pi\)-length of (finite) \(\pi\)-solvable semigroups (Q1393613) (← links)
• Product expansions (Q1899154) (← 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)
• BRET TILSON: HIS LIFE AND WORK (Q3561114) (← links)
• A PROFINITE APPROACH TO STABLE PAIRS (Q3561122) (← links)
• The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs (Q4596405) (← links)
• Krohn-Rhodes complexity pseudovarieties are not finitely based (Q4680740) (← links)
• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY (Q4786270) (← links)
• PROFINITE METHODS IN SEMIGROUP THEORY (Q4786315) (← links)
• An effective lower bound for group complexity of finite semigroups and automata (Q5389413) (← links)
• The fundamental lemma of complexity for arbitrary finite semigroups (Q5577140) (← links)
• Studies in the Representation Theory of Finite Semigroups (Q5635622) (← links)