Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/132602
Title: A minimal nonfinitely based semigroup whose variety is polynomially recognizable
Authors: Volkov, M. V.
Goldberg, S. V.
Kublanovsky, S. I.
Issue Date: 2011
Publisher: Springer Science and Business Media LLC
Citation: 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
Abstract: 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.
URI: http://elar.urfu.ru/handle/10995/132602
Access: info:eu-repo/semantics/openAccess
All Open Access, Green
SCOPUS ID: 80052372467
PURE ID: 7880952
ISSN: 1072-3374
DOI: 10.1007/s10958-011-0512-6
metadata.dc.description.sponsorship: 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.
Appears in Collections:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-80052372467.pdf225,51 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.