3 citations · 6 across the 6 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.GR2010★ 3 cited
On the Rees-Sushkevich variety
Stanislav Kublanovsky
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties in terms of "forbidden" semigroups. We als…
math.GR2010★ 2 cited
A minimal nonfinitely based semigroup whose variety is polynomially recognizable
Mikhail V. Volkov, Svetlana V. Goldberg, Stanislav I. Kublanovsky
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.