FINITELY BASED WORDS
From MaRDI portal
Publication:4786258
DOI10.1142/S0218196700000224zbMath1010.20043MaRDI 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
68R15: Combinatorics on words
20M07: Varieties and pseudovarieties of semigroups
20M05: Free semigroups, generators and relations, word problems
Related Items
Monoid varieties with extreme properties, Termal Groupoids, Classification of limit varieties of 𝒥-trivial monoids, Representations and identities of hypoplactic monoids with involution, Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups, The finite basis problem for words with at most two non-linear variables., Inherently non-finitely generated varieties of aperiodic monoids with central idempotents., Cross varieties of aperiodic monoids with central idempotents., Non-finitely based monoids., Finitely based monoids., Classification of finitely based words in a class of words over a \(3\)-letter alphabet., 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.
Cites Work
