77 citations · 264 across the 36 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
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.
cs.FL2010★ 25 cited
Slowly synchronizing automata and digraphs
Dmitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov
We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states. These automata are closely…