Publications
Reducibility vs. definability for pseudovarieties of semigroups. International Journal of Algebra and Computation. 2016;26(7):1483-1495.Edit
On regular implicit operations. Portugal. Math.. 1993;50:35-61.Edit
Relatively free profinite monoids: an introduction and examples. In: Semigroups, formal languages and groups (York, 1993). Vol 466. Kluwer Acad. Publ., Dordrecht; 1995. 7. p. 73-117p. (NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci.; vol 466).Edit
[2006-20] Representation theory of finite semigroups, semigroup radicals and formal language theory .Edit
Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc.. 2009;361:1429-1461.Edit
[2015-34] Representations of relatively free profinite semigroups, irreducibility, and order primitivity .Edit
Residually finite congruences and quasi-regular subsets in uniform algebras. Portugal. Math.. 1989;46:313-328.Edit
Residually finite congruences and quasiregular subsets in uniform algebras. In: Proceedings of the Second Meeting of Portuguese Algebraists (Portuguese) (Porto, 1987). Univ. Porto, Porto; 1987. 1. p. 11-31p. Edit
SC-hyperdecidability of $\bf R$. Theoret. Comput. Sci.. 2001;255:569-591.Edit
Semidirect product with an order-computable pseudovariety and tameness. Semigroup Forum. 2010;81:26-50.Edit
Semidirect products of pseudovarieties from the universal algebraist's point of view. J. Pure Appl. Algebra. 1989;60:113-128.Edit
Semidirect products with the pseudovariety of all finite groups. In: Words, languages & combinatorics, III (Kyoto, 2000). World Sci. Publ., River Edge, NJ; 2003. 1. p. 1-21p. Edit
Semidirectly closed pseudovarieties of locally trivial semigroups. Semigroup Forum. 1990;40:315-323.Edit
Semigroups whose idempotents form a subsemigroup. Math. Proc. Cambridge Philos. Soc.. 1992;111:241-253.Edit
Semigrupos finitos e álgebra universal Universidade de São Paulo, Instituto de Matemática e Estatí stica, São Paulo 1991.Edit
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. In: Development in Language Theory, DLT 2014. Vol LNCS, 8633.; 2014. 4. p. 49-60p. Edit
Semisimple synchronizing automata and the Wedderburn-Artin theory. In: Developments in Language Theory, 2014. Vol Developments in Language Theory. Russia, Ekaterinburg: Springer; 2014. 4. p. 49-60p. Edit
Semisimple synchronizing automata and the Wedderburn-Artin theory. Internat. J. Foundat. Comput. Sci.. 2016;27(2):127-145.Edit
A sequence of weakly monotonic automata with increasing level. Int. J. Algebra. 2013;7:91-100.Edit
Some algorithmic problems for pseudovarieties. Publ. Math. Debrecen. 1999;54:531-552.Edit
Some algorithms on the star operation applied to finite languages. Semigroup Forum. 1984;28:187-197.Edit
Some key problems on finite semigroups. Semigroup Forum. 2002;64:159-179.Edit
Some order properties of the lattice of varieties of commutative semigroups. Canad. J. Math.. 1986;38:19-47.Edit