Publications
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
The algebra of implicit operations. Algebra Universalis. 1989;26:16-32.Edit
An automata-theoretic approach to the word problem for ω-terms over $\ssfR$. Theoret. Comput. Sci.. 2007;370:131-169.Edit
Characterization of group radicals with an application to Mal\cprime cev products. Illinois J. Math.. 2010;54:199-221.Edit
A classification of aperiodic power monoids. J. Algebra. 1994;170:355-387.Edit
Closures of regular languages for profinite topologies. Semigroup Forum. 2014;89:20-40.Edit
Commutative positive varieties of languages. Acta Cybernetica. 2017;23(1):91-111.Edit
Complete kappa-reducibility of pseudovarieties of the form DRH. International Journal of Algebra and Computation. 2017;27(02):189-236.Edit
[2006-19] Complete reducibility of pseudovarieties .Edit
Complete reducibility of pseudovarieties. In: Semigroups and formal languages. World Sci. Publ., Hackensack, NJ; 2007. 9. p. 9-25p. Edit
Complete reducibility of systems of equations with respect to $\ssf R$. Port. Math. (N.S.). 2007;64:445-508.Edit
Complete κ-reducibility of pseudovarieties of the form DRH. International Journal of Algebra and Computation. 2017;27(2):189-235.Edit
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
A counterexample to a conjecture concerning concatenation hierarchies. Inform. Process. Lett.. 2009;110:4-7.Edit
Counting factors in words, semidirect products and power semigroups. In: Words, languages and combinatorics (Kyoto, 1990). World Sci. Publ., River Edge, NJ; 1992. 1. p. 1-15p. Edit
Decidability and tameness in the theory of finite semigroups. Bull. Iranian Math. Soc.. 2008;34:1-22.Edit