Classification of finitely based words in a class of words over a \(3\)-letter alphabet.

DOI10.1007/s00233-015-9712-6zbMath1337.20063OpenAlexW2083957843MaRDI QIDQ896250

Yan-Feng Luo, Jian-Rong Li

Publication date: 9 December 2015

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-015-9712-6

zbMATH Keywords

bases of identitiessyntactic monoidsfinitely based words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Equational logic, Mal'tsev conditions (08B05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

On the finite basis problem for the monoids of partial extensive injective transformations. ⋮ Finitely based sets of 2-limited block-2-simple words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finiteness properties of varieties and the restriction to finite algebras.
• On the finite basis problem for certain 2-limited words.
• Bases for equational theories of semi-groups
• FINITELY BASED, FINITE SETS OF WORDS
• FINITELY BASED WORDS
• Combinatorial Algebra: Syntax and Semantics

This page was built for publication: Classification of finitely based words in a class of words over a \(3\)-letter alphabet.