A minimal nonfinitely based semigroup whose variety is polynomially recognizable
Электронный научный архив УРФУ
Информация об архиве | Просмотр оригинала| Поле | Значение | |
| Заглавие |
A minimal nonfinitely based semigroup whose variety is polynomially recognizable
|
|
| Автор |
Volkov, M. V.
Goldberg, S. V. Kublanovsky, S. I. |
|
| Описание |
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm. © 2011 Springer Science+Business Media, Inc.
2.1.1/3537; Russian Foundation for Basic Research, RFBR: 09-01-12142 Acknowledgement. The first and the second authors acknowledge support from the Federal Education Agency of Russia, project 2.1.1/3537, and from the Russian Foundation for Basic Research, grant 09-01-12142. |
|
| Дата |
2024-04-24T12:38:26Z
2024-04-24T12:38:26Z 2011 |
|
| Тип |
Article
Journal article (info:eu-repo/semantics/article) info:eu-repo/semantics/submittedVersion |
|
| Идентификатор |
Volkov, M. V., Goldberg, S. V., & Kublanovsky, S. I. (2011). A minimal nonfinitely based semigroup whose variety is polynomially recognizable. Journal of Mathematical Sciences, 177(6), 847–859. doi:10.1007/s10958-011-0512-6
1072-3374 Final All Open Access, Green https://arxiv.org/pdf/1008.2425 http://elar.urfu.ru/handle/10995/132602 10.1007/s10958-011-0512-6 |
|
| Язык |
en
|
|
| Права |
Open access (info:eu-repo/semantics/openAccess)
|
|
| Формат |
application/pdf
|
|
| Издатель |
Springer Science and Business Media LLC
|
|
| Источник |
Journal of Mathematical Sciences
Journal of Mathematical Sciences |
|