Publications
[2004-21] Tameness of pseudovariety joins involving R .Edit
Implicit operations and Knast's theorem. In: Semigroups (Luino, 1992). World Sci. Publ., River Edge, NJ; 1993. 1. p. 1-16p. Edit
Closures of regular languages for profinite topologies. Semigroup Forum. 2014;89:20-40.Edit
[2006-44] Pointlike sets with respect to R and J .Edit
Tameness of pseudovarieties of semigroups. S\=urikaisekikenky\=usho Kōky\=uroku. 2000:8-16.Edit
[2017-1] The linear nature of pseudowords .Edit
On iterated semidirect products of finite semilattices. J. Algebra. 1991;142:239-254.Edit
Rational codes and free profinite monoids. J. Lond. Math. Soc. (2). 2009;79:465-477.Edit
Pseudovariety joins involving $\scr J$-trivial semigroups. Internat. J. Algebra Comput.. 1999;9:99-112.Edit
[2006-20] Representation theory of finite semigroups, semigroup radicals and formal language theory .Edit
Residually finite congruences and quasi-regular subsets in uniform algebras. Portugal. Math.. 1989;46:313-328.Edit
An automata-theoretic approach to the word problem for ω-terms over $\ssfR$. Theoret. Comput. Sci.. 2007;370:131-169.Edit
Iterated Kantorovich versus Kulkarni method for Fredholm integral equations. Vol Integral Methods in Science and Engineering. Vol. 2: Practical Applications Italy, Padova: Birkhäuser Basel 2017.Edit
Free profinite semigroups over semidirect products. Izv. Vyssh. Uchebn. Zaved. Mat.. 1995:3-31.Edit
On the hyperdecidability of semidirect products of pseudovarieties. Comm. Algebra. 1998;26:4065-4077.Edit
Complete kappa-reducibility of pseudovarieties of the form DRH. International Journal of Algebra and Computation. 2017;27(02):189-236.Edit
Overlapping of words in rational languages. In: Combinatorics on words (Waterloo, Ont., 1982). Academic Press, Toronto, ON; 1983. 1. p. 119-131p. Edit
Implicit operations on certain classes of semigroups. In: Semigroups and their applications (Chico, Calif., 1986). Reidel, Dordrecht; 1987. 1. p. 1-11p. Edit
José Morgado: in memoriam. Bol. Soc. Port. Mat.. 2004:1-18.Edit
Sur certains systèmes d'équations avec contraintes dans un groupe libre–-addenda. Port. Math. (N.S.). 2001;58:379-387.Edit