|
Fundamentalnaya i Prikladnaya Matematika, 2010, Volume 16, Issue 3, Pages 105–122
(Mi fpm1321)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
A minimal infinitely based semigroup whose variety is polynomially recognizable
M. V. Volkova, S. V. Goldberga, 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.
Citation:
M. V. Volkov, S. V. Goldberg, S. I. Kublanovsky, “A minimal infinitely based semigroup whose variety is polynomially recognizable”, Fundam. Prikl. Mat., 16:3 (2010), 105–122; J. Math. Sci., 177:6 (2011), 847–859
Linking options:
https://www.mathnet.ru/eng/fpm1321 https://www.mathnet.ru/eng/fpm/v16/i3/p105
|
Statistics & downloads: |
Abstract page: | 387 | Full-text PDF : | 140 | References: | 46 | First page: | 2 |
|