Classification of finitely based words in a class of words over a 3-letter alphabet.
DOI10.1007/S00233-015-9712-6zbMATH Open1337.20063OpenAlexW2083957843MaRDI QIDQ896250FDOQ896250
Authors: Jian Rong Li, Yanfeng Luo 
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
Recommendations
Combinatorics on words (68R15) Equational logic, Mal'tsev conditions (08B05) Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Finiteness properties of varieties and the restriction to finite algebras.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the finite basis problem for certain 2-limited words.
- Bases for equational theories of semi-groups
- Finitely based, finite sets of words
- The finite basis problem for finite semigroups
- Title not available (Why is that?)
- Title not available (Why is that?)
- FINITELY BASED WORDS
- Combinatorial algebra: syntax and semantics. With contributions by Victor S. Guba and Mikhail V. Volkov
Cited In (4)
This page was built for publication: Classification of finitely based words in a class of words over a \(3\)-letter alphabet.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896250)
