Publications
On finite simple semigroups. Proc. Edinburgh Math. Soc. (2). 1991;34:205-215.Edit
Finite semigroups and universal algebra. Vol 3 World Scientific Publishing Co., Inc., River Edge, NJ 1994.Edit
Finite semigroups: an introduction to a unified theory of pseudovarieties. In: Semigroups, algorithms, automata and languages (Coimbra, 2001). World Sci. Publ., River Edge, NJ; 2002. 3. p. 3-64p. Edit
Factoriality and the Pin-Reutenauer procedure. Discrete Math. Theor. Comput. Sci.. 2016;18:Paper No. 1, 23.Edit
Equidivisible pseudovarieties of semigroups. Publicationes Mathematicae. 2017;90(3-4):435-453.Edit
[2016-26] Equidivisible pseudovarieties of semigroups .Edit
Equations for pseudovarieties. In: Formal properties of finite automata and applications (Ramatuelle, 1988). Vol 386. Springer, Berlin; 1989. 1. p. 148-164p. (Lecture Notes in Comput. Sci.; vol 386).Edit
The equational theory of ω-terms for finite $\scr R$-trivial semigroups. In: Semigroups and languages. World Sci. Publ., River Edge, NJ; 2004. 1. p. 1-22p. Edit
On the equation $\bf V\ast\bf G=\scr E\,\bf V$. J. Pure Appl. Algebra. 2002;166:1-28.Edit
The equation $\bf PX=\bf PJ$. In: Proceedings of the International Symposium on the Semigroup Theory and its Related Fields (Kyoto, 1990). Shimane Univ., Matsue; 1990. 1. p. 1-11p. Edit
An elementary proof that finite groups are projectively torsion-free. Portugal. Math.. 1990;47:437-444.Edit
Dynamics of implicit operations and tameness of pseudovarieties of groups. Trans. Amer. Math. Soc.. 2002;354:387-411 (electronic).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
On direct product decompositions of finite $\scr J$-trivial semigroups. Internat. J. Algebra Comput.. 1991;1:329-337.Edit
Description and analysis of a bottom-up DFA minimization algorithm. Inform. Process. Lett.. 2008;107:52-59.Edit
On the decidability of iterated semidirect products with applications to complexity. Proc. London Math. Soc. (3). 2000;80:50-74.Edit
On Decidability of Intermediate Levels of Concatenation Hierarchies. In: 19th International Conference Developments in Language Theory (DLT 2015). Vol Developments in Language Theory, LNCS 9168. UK, Liverpool: Springer; 2015. 5. p. 58-70p. Edit
Decidability and tameness in the theory of finite semigroups. Bull. Iranian Math. Soc.. 2008;34:1-22.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
A counterexample to a conjecture concerning concatenation hierarchies. Inform. Process. Lett.. 2009;110:4-7.Edit