Publications
Clifford monoid presentations. Math. Proc. Cambridge Philos. Soc.. 1992;111:445-454.
A geometric characterization of automatic monoids. Q. J. Math.. 2004;55:333-356.Edit
Fixed points of endomorphisms over special confluent rewriting systems. Monatsh. Math.. 2010;161:417-447.
The word problem for nilpotent inverse monoids. Semigroup Forum. 1995;51:285-293.
José Anastácio da Cunha e a Álgebra do seu tempo. CMUM ed. Portugal, Braga: Universidade do Minho. Centro de Matemática (CMAT) 2005.Edit
Fixed points of endomorphisms of certain free products. RAIRO Theor. Inform. Appl.. 2012;46:165-179.
Dicionário de Matemática Elementar, de Stella Baruk. Vol 2 Edições Afrontamento 2005.Edit
Finite automata for Schreier graphs of virtually free groups. J. Group Theory. 2016;19:25-54.Edit
[2017-28] On finitely generated submonoids of free groups .
Effects of pitch size and skill level on tactical behaviours of Association Football players during small-sided and conditioned games. International Journal of Sports Science & Coaching. 2014;9:993-1006.Edit
A note on primeness of semigroup rings. Proc. Roy. Soc. Edinburgh Sect. A. 1992;120:191-197.
An application of first-order logic to the study of recognizable languages. Internat. J. Algebra Comput.. 2004;14:785-799.
On unique factorization semilattices. Discuss. Math. Gen. Algebra Appl.. 2000;20:97-120.
[2012-16] Groups and automata: a perfect match .
The algebraic content of Bento Fernandes’s Tratado da arte de arismetica (1555). Historia Mathematica . 2008;35 :190-219.Edit
Conjugacy and transposition for inverse monoid presentations. Internat. J. Algebra Comput.. 1996;6:607-622.
a partitional clustering algorithm validated by a clustering tendency index based on graph theory. pattern recognition. 2006;39:776-788.Edit
A note on pure and $p$-pure languages. Acta Inform.. 2003;39:579-595.