The following pages link to FINITELY BASED WORDS (Q4786258):
Displayed 19 items.
- The finite basis problem for words with at most two non-linear variables. (Q305772) (← links)
- Inherently non-finitely generated varieties of aperiodic monoids with central idempotents. (Q499391) (← links)
- Cross varieties of aperiodic monoids with central idempotents. (Q658576) (← links)
- Non-finitely based monoids. (Q744847) (← links)
- Finitely based monoids. (Q744848) (← links)
- Classification of finitely based words in a class of words over a \(3\)-letter alphabet. (Q896250) (← links)
- Finite semigroups whose varieties have uncountably many subvarieties (Q1570360) (← links)
- On the finite basis problem for certain 2-limited words. (Q1940888) (← links)
- Almost cross varieties of aperiodic monoids with central idempotents. (Q1943346) (← links)
- Finitely based sets of 2-limited block-2-simple words (Q2009667) (← links)
- Nonfinitely based ai-semirings with finitely based semigroup reducts (Q2079231) (← links)
- The lattice of varieties of monoids (Q2105481) (← links)
- Cancellable elements of the lattice of monoid varieties (Q2236649) (← links)
- Small semigroups generating varieties with continuum many subvarieties. (Q2270176) (← links)
- Monoid varieties with extreme properties (Q4635479) (← links)
- Termal Groupoids (Q4799998) (← links)
- Classification of limit varieties of 𝒥-trivial monoids (Q5080185) (← links)
- Representations and identities of hypoplactic monoids with involution (Q6149464) (← links)
- Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups (Q6170751) (← links)