On the finite basis problem for certain 2-limited words.

DOI10.1007/s10114-012-0193-1zbMath1271.20068OpenAlexW2000601605MaRDI QIDQ1940888

Wen Ting Zhang, Yan-Feng Luo, Jian-Rong Li

Publication date: 8 March 2013

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-012-0193-1

zbMATH Keywords

free monoidsfinite basis problemsemigroup identitiesvarieties of semigroups2-limited wordsdiscrete syntactic monoids

Mathematics Subject Classification ID

Combinatorics on words (68R15) Varieties and pseudovarieties of semigroups (20M07) Equational logic, Mal'tsev conditions (08B05)

Related Items (5)

The finite basis problem for words with at most two non-linear variables. ⋮ On the finite basis problem for the monoids of partial extensive injective transformations. ⋮ Classification of finitely based words in a class of words over a \(3\)-letter alphabet. ⋮ Finitely based sets of 2-limited block-2-simple words ⋮ Non-finitely based monoids.

Cites Work

• The subvariety lattice of the join of two semigroup varieties.
• Varieties generated by semigroups of order four
• On certain finitely based varieties of semigroups
• Finite semigroups whose varieties have uncountably many subvarieties
• Finiteness properties of varieties and the restriction to finite algebras.
• Identity bases for some non-exact varieties.
• Bases for equational theories of semi-groups
• FINITELY BASED, FINITE SETS OF WORDS
• FINITELY BASED WORDS
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
• FINITE SEMIGROUPS WITH INFINITE IRREDUNDANT IDENTITY BASES
• SUBVARIETIES OF THE VARIETY GENERATED BY THE FIVE-ELEMENT BRANDT SEMIGROUP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the finite basis problem for certain 2-limited words.