Pages that link to "Item:Q1899162"
From MaRDI portal
The following pages link to Subsemigroups and complexity via the presentation lemma (Q1899162):
Displaying 18 items.
- Another semigroup of complexity \(n-1\) (Q1176628) (← links)
- On calculating the Krohn-Rhodes decomposition of automata (Q1366274) (← links)
- On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. (Q1421252) (← links)
- On complete systems of automata (Q1575734) (← links)
- From relation to emulation: The covering lemma for transformation semigroups (Q1916148) (← links)
- Improved lower bounds for the complexity of finite semigroups (Q2559565) (← links)
- On the Dowling and Rhodes lattices and wreath products (Q2664480) (← links)
- HOLONOMY EMBEDDING OF ARBITRARY STABLE SEMIGROUPS (Q3043637) (← links)
- WHAT ARE MODULES? AN OVERVIEW OF BRET TILSON'S PAPER "MODULES" FROM A GEOMETRIC VIEWPOINT (Q3561116) (← links)
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS (Q4513305) (← links)
- ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM (Q4645828) (← links)
- Krohn-Rhodes complexity pseudovarieties are not finitely based (Q4680740) (← links)
- ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS (Q4786248) (← links)
- ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES (Q5292274) (← 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)
- Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples (Q6043405) (← links)
- The Rhodes semilattice of a biased graph (Q6657297) (← links)
