FINITELY BASED, FINITE SETS OF WORDS

DOI10.1142/S0218196700000327zbMath0980.20052OpenAlexW2018987884MaRDI QIDQ2709973

Marcel Jackson, Olga Sapir

Publication date: 21 November 2001

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196700000327

zbMATH Keywords

wordsfinite semigroupsfinite basis problemfinitely based semigroupsnon-finitely based semigroups

Mathematics Subject Classification ID

Combinatorics on words (68R15) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05)

Related Items

The finite basis problem for words with at most two non-linear variables. ⋮ The Division Relation: Congruence Conditions and Axiomatisability ⋮ 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. ⋮ Almost cross varieties of aperiodic monoids with central idempotents. ⋮ Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups ⋮ Limit varieties generated by finite non-J-trivial aperiodic monoids ⋮ Varieties generated by unstable involution semigroups with continuum many subvarieties ⋮ Varieties of aperiodic monoids with central idempotents whose subvariety lattice is distributive ⋮ Chain varieties of monoids ⋮ Varieties of monoids with complex lattices of subvarieties ⋮ Cross varieties of aperiodic monoids with central idempotents. ⋮ Monoid varieties with extreme properties ⋮ Inherently non-finitely generated varieties of aperiodic monoids with central idempotents. ⋮ LEE MONOIDS ARE NONFINITELY BASED WHILE THE SETS OF THEIR ISOTERMS ARE FINITELY BASED ⋮ Limit varieties of aperiodic monoids with commuting idempotents ⋮ Finitely based sets of 2-limited block-2-simple words ⋮ Standard elements of the lattice of monoid varieties ⋮ Limit varieties of \(J\)-trivial monoids ⋮ Non-finitely based monoids. ⋮ Finitely based monoids. ⋮ Finite semigroups whose varieties have uncountably many subvarieties ⋮ Nonfinitely based ai-semirings with finitely based semigroup reducts ⋮ On the ascending and descending chain conditions in the lattice of monoid varieties ⋮ Non-finitely based finite involution semigroups with finitely based semigroup reducts

Cites Work

• Basic questions for general algebras
• On cross semigroup varieties and related questions
• Bases for equational theories of semi-groups
• PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS
• INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS
• ALGORITHMIC PROBLEMS IN VARIETIES
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE