Publications
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 .
a partitional clustering algorithm validated by a clustering tendency index based on graph theory. pattern recognition. 2006;39:776-788.Edit
Free group languages: rational versus recognizable. Theor. Inform. Appl.. 2004;38:49-67.
[2012-16] Groups and automata: a perfect match .
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
Extensions and submonoids of automatic monoids. Theoret. Comput. Sci.. 2002;289:727-754.Edit
On the semilattice of idempotents of a free inverse monoid. Proc. Edinburgh Math. Soc. (2). 1993;36:349-360.
On a class of automata groups generalizing lamplighter groups. Internat. J. Algebra Comput.. 2005;15:1213-1234.Edit
Luis Inacio Woodhouse (1857-1927). Vol 1. U. Porto Edições ed. 2018.Edit
Finite idempotent inverse monoid presentations. Internat. J. Algebra Comput.. 2011;21:1111-1133.
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
Shared knowledge or shared affordances? insights from an ecological dynamics approach to team coordination in sports. Sports Medicine. 2013;43:765-772.Edit
Equações no «Libro de Algebra» de Pedro Nunes. Vol 68 APM 2002.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.
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.