FINITELY BASED WORDS
From MaRDI portal
Recommendations
Cites work
Cited in
(23)- Finite semigroups whose varieties have uncountably many subvarieties
- On the finite basis problem for certain 2-limited words.
- Almost cross varieties of aperiodic monoids with central idempotents.
- Finitely based sets of 2-limited block-2-simple words
- Nonfinitely based ai-semirings with finitely based semigroup reducts
- The lattice of varieties of monoids
- Cancellable elements of the lattice of monoid varieties
- Small semigroups generating varieties with continuum many subvarieties.
- Finitely based, finite sets of words
- scientific article; zbMATH DE number 1668759 (Why is no real title available?)
- The finite basis problem for words with at most two non-linear variables.
- Monoid varieties with extreme properties
- Termal Groupoids
- Inherently non-finitely generated varieties of aperiodic monoids with central idempotents.
- Classification of limit varieties of \(\mathcal{J}\)-trivial monoids
- Representations and identities of hypoplactic monoids with involution
- Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups
- Cross varieties of aperiodic monoids with central idempotents.
- Finitely and non-finitely related words
- The Rees quotient monoid \(M(abba)\) generates a variety with uncountably many subvarieties
- Non-finitely based monoids.
- Finitely based monoids.
- Classification of finitely based words in a class of words over a 3-letter alphabet.
This page was built for publication: FINITELY BASED WORDS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786258)