Finitely based sets of 2-limited block-2-simple words

DOI10.1007/S00233-019-10063-8MaRDI QIDQ2009667zbMATH OpenOpenAlexWikidataFDO

Authors Olga Sapir

Publication date 29 November 2019

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.07920

zbMATH Keywords

discrete syntactic monoidsfinite basis problemfinite Rees quotients of free monoidsisoterms

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05)

Abstract: Let $mathfrakA$ be an alphabet and $W$ be a set of words in the free monoid ${mathfrakA}^{\ast }$. Let $S(W)$ denote the Rees quotient over the ideal of ${mathfrakA}^{\ast }$ consisting of all words that are not subwords of words in $W$. A set of words $W$ is called {em finitely based} if the monoid $S(W)$ is finitely based. A word $$ is called 2-limited if each variable occurs in $$ at most twice. A {em block} of a word $$ is a maximal subword of $$ that does not contain any linear variables. We say that a word $$ is {em block-2-simple} if each block of $$ involves at most two distinct variables. We provide an algorithm that recognizes finitely based sets of words among sets of 2-limited block-2-simple words. We also present new sufficient conditions under which a set of words is non-finitely based.

Recommendations

• On the finite basis problem for certain 2-limited words.
• Classification of finitely based words in a class of words over a 3-letter alphabet.
• The finite basis problem for words with at most two non-linear variables.
• FINITELY BASED WORDS
• Finitely based monoids.

Cites work

• Bases for equational theories of semi-groups
• Classification of finitely based words in a class of words over a 3-letter alphabet.
• Finitely based monoids.
• FINITELY BASED WORDS
• Finitely based, finite sets of words
• Finiteness properties of varieties and the restriction to finite algebras.
• scientific article; zbMATH DE number 4023572 (Why is no real title available?)
• Maximal Specht varieties of monoids.
• Non-finitely based monoids.
• On the finite basis problem for certain 2-limited words.
• The finite basis problem for words with at most two non-linear variables.

Cited in

(11)

• On the finite basis problem for certain 2-limited words.
• On sets of words of rank two
• Varieties of aperiodic monoids with central idempotents whose subvariety lattice is distributive
• 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.
• FINITELY BASED WORDS
• Varieties of monoids with complex lattices of subvarieties
• Small monoids generating varieties 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 sets of 2-limited block-2-simple words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009667)