Publications
An automata-theoretic approach to the word problem for ω-terms over $\ssfR$. Theoret. Comput. Sci.. 2007;370:131-169.Edit
Closures of regular languages for profinite topologies. Semigroup Forum. 2014;89:20-40.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
Description and analysis of a bottom-up DFA minimization algorithm. Inform. Process. Lett.. 2008;107:52-59.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
Factoriality and the Pin-Reutenauer procedure. Discrete Math. Theor. Comput. Sci.. 2016;18:Paper No. 1, 23.Edit
Iterated periodicity over finite aperiodic semigroups. European J. Combin.. 2014;37:115-149.Edit
[2017-1] The linear nature of pseudowords .Edit
McCammond's normal forms for free aperiodic semigroups revisited. LMS J. Comput. Math.. 2015;18:130-147.Edit
Pointlike sets with respect to $\bf R$ and $\bf J$. J. Pure Appl. Algebra. 2008;212:486-499.Edit
[2006-44] Pointlike sets with respect to R and J .Edit
The pseudovariety $\bf J$ is hyperdecidable. RAIRO Inform. Théor. Appl.. 1997;31:457-482.Edit
Pseudovariety joins involving $\scr J$-trivial semigroups. Internat. J. Algebra Comput.. 1999;9:99-112.Edit
Reducibility of pointlike problems. Semigroup Forum. 2017;94(2):325-335.Edit
[2004-21] Tameness of pseudovariety joins involving R .Edit
Tameness of pseudovariety joins involving R. Monatsh. Math.. 2005;146:89-111.Edit