RUS
ENG
Full version
JOURNALS
// Fundamentalnaya i Prikladnaya Matematika
// Archive
Fundam. Prikl. Mat.,
2010
Volume 16,
Issue 3,
Pages
105–122
(Mi fpm1321)
This article is cited in
2
papers
A minimal infinitely based semigroup whose variety is polynomially recognizable
M. V. Volkov
a
,
S. V. Goldberg
a
,
S. I. Kublanovsky
a
Ural State University
Abstract:
We exhibit a six-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
UDC:
512.552
Fulltext:
PDF file (251 kB)
References
Cited by
English version:
Journal of Mathematical Sciences (New York), 2011,
177
:6,
847–859
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024