Publications
On the semilattice of idempotents of a free inverse monoid. Proc. Edinburgh Math. Soc. (2). 1993;36:349-360.
The algebraic content of Bento Fernandes’s Tratado da arte de arismetica (1555). Historia Mathematica . 2008;35 :190-219.Edit
On a class of automata groups generalizing lamplighter groups. Internat. J. Algebra Comput.. 2005;15:1213-1234.Edit
a partitional clustering algorithm validated by a clustering tendency index based on graph theory. pattern recognition. 2006;39:776-788.Edit
Finite idempotent inverse monoid presentations. Internat. J. Algebra Comput.. 2011;21:1111-1133.
Field dimension and skill level constrain team tactical behaviours in small-sided and conditioned games in football. Journal of sports sciences. 2014;32:1888-1896.Edit
Luis Inacio Woodhouse (1857-1927). Vol 1. U. Porto Edições ed. 2018.Edit
Fixed points of endomorphisms of virtually free groups. Pacific J. Math.. 2013;263:207-240.
Rational subsets of partially reversible monoids. Theoret. Comput. Sci.. 2008;409:537-548.
A geometric characterization of automatic monoids. Q. J. Math.. 2004;55:333-356.Edit
Clifford monoid presentations. Math. Proc. Cambridge Philos. Soc.. 1992;111:445-454.
[2012-16] Groups and automata: a perfect match .
Fixed points of endomorphisms over special confluent rewriting systems. Monatsh. Math.. 2010;161:417-447.
On the circulation of algebraic knowledge in the Iberian península: the sources of Pérez de Moya's Tratado de Arithmetica (1573). Revue d'histoire des mathématiques . 2016;2:145-184.Edit
A note on Pérez de Moya's Principios de Geometria (1584). Revue d'histoire des mathématiques . 2008;14 ( fascicule 1 ):113-133.Edit
The word problem for nilpotent inverse monoids. Semigroup Forum. 1995;51:285-293.
Renaissance sources of Juan Pérez de Moya’s geometries. Asclepio. Revista de Historia de la Medicina y de la Ciencia. 2013;65 (2)(julio-diciembre ):1-18.Edit
Fixed points of endomorphisms of certain free products. RAIRO Theor. Inform. Appl.. 2012;46:165-179.
An application of first-order logic to the study of recognizable languages. Internat. J. Algebra Comput.. 2004;14:785-799.
Groups and automata: a perfect match. J. Automata Lang. Combin.. 2012;17(2-4):277-292.