FINITELY BASED WORDS
From MaRDI portal
Publication:4786258
DOI10.1142/S0218196700000224zbMath1010.20043OpenAlexW1997867393MaRDI QIDQ4786258
Publication date: 15 December 2002
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196700000224
Combinatorics on words (68R15) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05)
Related Items (19)
Termal Groupoids ⋮ The finite basis problem for words with at most two non-linear variables. ⋮ Classification of limit varieties of 𝒥-trivial monoids ⋮ Classification of finitely based words in a class of words over a \(3\)-letter alphabet. ⋮ On the finite basis problem for certain 2-limited words. ⋮ Representations and identities of hypoplactic monoids with involution ⋮ Almost cross varieties of aperiodic monoids with central idempotents. ⋮ Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups ⋮ Cross varieties of aperiodic monoids with central idempotents. ⋮ Monoid varieties with extreme properties ⋮ Cancellable elements of the lattice of monoid varieties ⋮ Inherently non-finitely generated varieties of aperiodic monoids with central idempotents. ⋮ Finitely based sets of 2-limited block-2-simple words ⋮ Small semigroups generating varieties with continuum many subvarieties. ⋮ Non-finitely based monoids. ⋮ Finitely based monoids. ⋮ Finite semigroups whose varieties have uncountably many subvarieties ⋮ Nonfinitely based ai-semirings with finitely based semigroup reducts ⋮ The lattice of varieties of monoids
Cites Work
This page was built for publication: FINITELY BASED WORDS
