A minimal nonfinitely based semigroup whose variety is polynomially recognizable
classification
🧮 math.GR
cs.CC
keywords
finitesemigroupvarietywhoseadmitsalgorithmbasiselement
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.