Publications
Complexity of the identity checking problem for finite semigroups. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI). 2008;358:5-22, 301.Edit
On finitely based pseudovarieties of the form $\bf V\ast\bf D$ and $\bf V\ast\bf D_n$. J. Pure Appl. Algebra. 2000;146:1-15.Edit
[2006-20] Representation theory of finite semigroups, semigroup radicals and formal language theory .Edit
Profinite categories and semidirect products. J. Pure Appl. Algebra. 1998;123:1-50.Edit
SC-hyperdecidability of $\bf R$. Theoret. Comput. Sci.. 2001;255:569-591.Edit
The algebra of implicit operations. Algebra Universalis. 1989;26:16-32.Edit
Profinite groups associated with weakly primitive substitutions. Fundam. Prikl. Mat.. 2005;11:13-48.Edit
Overlapping of words in rational languages. In: Combinatorics on words (Waterloo, Ont., 1982). Academic Press, Toronto, ON; 1983. 1. p. 119-131p. Edit
A classification of aperiodic power monoids. J. Algebra. 1994;170:355-387.Edit
Tameness of some locally trivial pseudovarieties. Comm. Algebra. 2003;31:61-77.Edit
Complete κ-reducibility of pseudovarieties of the form DRH. International Journal of Algebra and Computation. 2017;27(2):189-235.Edit
On direct product decompositions of finite $\scr J$-trivial semigroups. Internat. J. Algebra Comput.. 1991;1:329-337.Edit
Iterated Kantorovich versus Kulkarni method for Fredholm integral equations. Vol Integral Methods in Science and Engineering. Vol. 2: Practical Applications Italy, Padova: Birkhäuser Basel 2017.Edit
A counterexample to a conjecture concerning concatenation hierarchies. Inform. Process. Lett.. 2009;110:4-7.Edit
[2008-21] Rational Codes and Free Profinite Monoids .Edit
Complete kappa-reducibility of pseudovarieties of the form DRH. International Journal of Algebra and Computation. 2017;27(02):189-236.Edit
Hyperdecidability of pseudovarieties of orthogroups. Glasg. Math. J.. 2001;43:67-83.Edit
Fetal QRS detection and heart rate estimation: A wavelet-based approach. Physiological Measurement. 2014;35:1723-1735.Edit