A minimal nonfinitely based semigroup whose variety is polynomially recognizable
Group Theory
2014-11-25 v1 Computational Complexity
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.
Cite
@article{arxiv.1008.2425,
title = {A minimal nonfinitely based semigroup whose variety is polynomially recognizable},
author = {Mikhail V. Volkov and Svetlana V. Goldberg and Stanislav I. Kublanovsky},
journal= {arXiv preprint arXiv:1008.2425},
year = {2014}
}
Comments
16 pages, 3 figures