Classification of finitely based words in a class of words over a 3-letter alphabet.
From MaRDI portal
(Redirected from Publication:896250)
Classification of finitely based words in a class of words over a \(3\)-letter alphabet.
Classification of finitely based words in a class of words over a \(3\)-letter alphabet.
Recommendations
Cites work
- scientific article; zbMATH DE number 1668759 (Why is no real title available?)
- scientific article; zbMATH DE number 4023572 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- Bases for equational theories of semi-groups
- Combinatorial algebra: syntax and semantics. With contributions by Victor S. Guba and Mikhail V. Volkov
- FINITELY BASED WORDS
- Finitely based, finite sets of words
- Finiteness properties of varieties and the restriction to finite algebras.
- On the finite basis problem for certain 2-limited words.
- The finite basis problem for finite semigroups
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)