Publications
Decidability and tameness in the theory of finite semigroups. Bull. Iranian Math. Soc.. 2008;34:1-22.Edit
[2009-39] New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy .Edit
On the decidability of iterated semidirect products with applications to complexity. Proc. London Math. Soc. (3). 2000;80:50-74.Edit
Exploring QT variability dependence from heart rate in coma and brain death on pediatric patients. In: Computing in Cardiology Conference (CinC), 2013.; 2013. 6. p. 61-64p. Edit
On power varieties of semigroups. J. Algebra. 1989;120:1-17.Edit
Tameness of pseudovariety joins involving R. Monatsh. Math.. 2005;146:89-111.Edit
The pseudovariety $\bf J$ is hyperdecidable. RAIRO Inform. Théor. Appl.. 1997;31:457-482.Edit
Errors and grids for projected weakly singular integral equations. International Journal of Pure and Applied Mathematics . 2013;89:203-213.Edit
Dynamics of finite semigroups. In: Semigroups, algorithms, automata and languages (Coimbra, 2001). World Sci. Publ., River Edge, NJ; 2002. 2. p. 269-292p. Edit
Reduced factorizations in free profinite groups and join decompositions of pseudovarieties. Internat. J. Algebra Comput.. 1994;4:375-403.Edit
[2016-26] Equidivisible pseudovarieties of semigroups .Edit
Recent developments in the theory of implicit operations. In: Monoids and semigroups with applications (Berkeley, CA, 1989). World Sci. Publ., River Edge, NJ; 1991. 1. p. 105-117p. Edit
ARFIMA-GARCH Modeling of HRV: Clinical Application in Acute Brain Injury. In: Complexity and Nonlinearity in Cardiovascular Signals. Cham: Springer International Publishing; 2017. 4. p. 451-468p. Edit
Gérard Lallement (1935–2006). Semigroup Forum. 2009;78:379-383.Edit
On fixed points of the lower set operator. Int. J. Algebra Comput.. 2015;25(1-2):259-292.Edit
Improved QT variability quantification by multilead automatic delineation. In: {32nd Annual Conference on Computers in Cardiology}. Vol {32}. {IEEE}; 2005. {. {p. 503-506p. }.Edit
An addendum: ``The gap between partial and full'' [Internat. J. Algebra Comput. \bf 8 (1998), no. 3, 399–430; MR1627844 (99g:20102)]. Internat. J. Algebra Comput.. 2001;11:131-135.Edit
Semisimple synchronizing automata and the Wedderburn-Artin theory. Internat. J. Foundat. Comput. Sci.. 2016;27(2):127-145.Edit