A minimal nonfinitely based semigroup whose variety is polynomially recognizable

preprint2010arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.