A minimal nonfinitely based semigroup whose variety is polynomially recognizable

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.

DOI: 10.1007/s10958-011-0512-6

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Volkov2010AMN, title={A minimal nonfinitely based semigroup whose variety is polynomially recognizable}, author={Mikhail V. Volkov and Svetlana V. Goldberg and Stanislav I. Kublanovsky}, journal={CoRR}, year={2010}, volume={abs/1008.2425} }