FINITELY BASED WORDS

DOI10.1142/S0218196700000224zbMATH Open1010.20043OpenAlexW1997867393MaRDI QIDQ4786258FDOQ4786258

Authors: Olga Sapir 

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

Recommendations

• scientific article; zbMATH DE number 1668759
• The finite basis problem for words with at most two non-linear variables.
• On the finite basis problem for certain 2-limited words.
• Finitely based sets of 2-limited block-2-simple words
• Finitely based, finite sets of words

zbMATH Keywords

finite basis propertyfinitely based monoidsfree monoidsfinite languages

Mathematics Subject Classification ID

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

Cites Work

• 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
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE

Cited In (23)

• Finite semigroups whose varieties have uncountably many subvarieties
• Almost cross varieties of aperiodic monoids with central idempotents.
• Representations and identities of hypoplactic monoids with involution
• Small semigroups generating varieties with continuum many subvarieties.
• Title not available (Why is that?)
• The finite basis problem for words with at most two non-linear variables.
• Cancellable elements of the lattice of monoid varieties
• Nonfinitely based ai-semirings with finitely based semigroup reducts
• Finitely based monoids.
• Non-finitely based monoids.
• Finitely and non-finitely related words
• Monoid varieties with extreme properties
• The lattice of varieties of monoids
• The Rees quotient monoid \(M(abba)\) generates a variety with uncountably many subvarieties
• Classification of finitely based words in a class of words over a \(3\)-letter alphabet.
• Termal Groupoids
• On the finite basis problem for certain 2-limited words.
• Finitely based sets of 2-limited block-2-simple words
• Inherently non-finitely generated varieties of aperiodic monoids with central idempotents.
• Classification of limit varieties of \(\mathcal{J}\)-trivial monoids
• Cross varieties of aperiodic monoids with central idempotents.
• Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups
• Finitely based, finite sets of words

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)