Volkov, M. V.; Goldberg, S. V.; Kublanovsky, S. I. A minimal nonfinitely based semigroup whose variety is polynomially recognizable. (English. Russian original) Zbl 1290.20047 J. Math. Sci., New York 177, No. 6, 847-859 (2011); translation from Fundam. Prikl. Mat. 16, No. 3, 105-122 (2010). MSC: 20M07 20M05 08B15 PDFBibTeX XMLCite \textit{M. V. Volkov} et al., J. Math. Sci., New York 177, No. 6, 847--859 (2011; Zbl 1290.20047); translation from Fundam. Prikl. Mat. 16, No. 3, 105--122 (2010) Full Text: DOI arXiv
Almeida, J.; Volkov, M. V.; Goldberg, S. V. Complexity of the identity checking problem for finite semigroups. (English. Russian original) Zbl 1213.20052 J. Math. Sci., New York 158, No. 5, 605-614 (2009); translation from Zap. Nauchn. Semin. POMI 358, 5-22 (2008). Reviewer: Aleksandr V. Tishchenko (Moskva) MSC: 20M05 68Q15 68Q17 20M20 20F10 PDFBibTeX XMLCite \textit{J. Almeida} et al., J. Math. Sci., New York 158, No. 5, 605--614 (2009; Zbl 1213.20052); translation from Zap. Nauchn. Semin. POMI 358, 5--22 (2008) Full Text: DOI
Ananichev, D. S.; Petrov, I. V.; Volkov, M. V. Collapsing words: a progress report. (English) Zbl 1103.68063 Int. J. Found. Comput. Sci. 17, No. 3, 507-518 (2006). MSC: 68Q45 PDFBibTeX XMLCite \textit{D. S. Ananichev} et al., Int. J. Found. Comput. Sci. 17, No. 3, 507--518 (2006; Zbl 1103.68063) Full Text: DOI
Volkov, M. V. Checking quasi-identities in a finite semigroup may be computationally hard. (English) Zbl 1076.20043 Stud. Log. 78, No. 1-2, 349-356 (2004). Reviewer: Sheila Oates-Williams (Beerwah) MSC: 20M07 20M05 03D15 68Q17 68Q25 08C15 PDFBibTeX XMLCite \textit{M. V. Volkov}, Stud. Log. 78, No. 1--2, 349--356 (2004; Zbl 1076.20043) Full Text: DOI