Publications
a partitional clustering algorithm validated by a clustering tendency index based on graph theory. pattern recognition. 2006;39:776-788.Edit
The word problem for nilpotent inverse monoids. Semigroup Forum. 1995;51:285-293.
Fixed points of endomorphisms of certain free products. RAIRO Theor. Inform. Appl.. 2012;46:165-179.
[2010-14] Finite idempotent inverse monoid presentations .
Numerical relations and skill level constrain co-adaptive behaviors of agents in sports teams. PloS one. 2014;9:e107112.Edit
Finite automata for Schreier graphs of virtually free groups. J. Group Theory. 2016;19:25-54.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.
Luis Inacio Woodhouse (1857-1927). Vol 1. U. Porto Edições ed. 2018.Edit
On unique factorization semilattices. Discuss. Math. Gen. Algebra Appl.. 2000;20:97-120.
Conjugacy and transposition for inverse monoid presentations. Internat. J. Algebra Comput.. 1996;6:607-622.
A note on pure and $p$-pure languages. Acta Inform.. 2003;39:579-595.
On finite-index extensions of subgroups of free groups. J. Group Theory. 2010;13:365-381.Edit
Trees associated to inverse monoid presentations. J. Pure Appl. Algebra. 2001;165:307-335.
Dicionário de Matemática Elementar, de Stella Baruk. Vol 2 Edições Afrontamento 2005.Edit
Rational languages and inverse monoid presentations. Internat. J. Algebra Comput.. 1992;2:187-207.
[2017-28] On finitely generated submonoids of free groups .