Publications
Rational languages and inverse monoid presentations. Internat. J. Algebra Comput.. 1992;2:187-207.
The homomorphism problem for the free monoid. Discrete Math.. 2002;259:189-200.
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
On an algorithm to decide whether a free group is a free factor of another. Theor. Inform. Appl.. 2008;42:395-414.Edit
On free inverse monoid languages. RAIRO Inform. Théor. Appl.. 1996;30:349-378.
The homomorphism problem for trace monoids. Theoret. Comput. Sci.. 2003;307:199-215.
Recognizable subsets of a group: finite extensions and the abelian case. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS. 2002:195-215.
Groups and automata: a perfect match. J. Automata Lang. Combin.. 2012;17(2-4):277-292.
Automorphic orbits in free groups: words versus subgroups. Internat. J. Algebra Comput.. 2010;20:561-590.Edit
[2015-25] On the circulation of algebraic knowledge in the Iberian península: the sources of Pérez de Moya's Tratado de Arithmetica (1573) .Edit
Contribuição para o estudo do manuscrito Arte de Marear de Juan Pérez de Moya. LLULL. 2012;35(76):351-379.Edit
Normal-convex embeddings of inverse semigroups. Glasgow Math. J.. 1993;35:115-121.
Howson’s property for semidirect products of semilattices by groups. Comm. Algebra. 2016;44(6):2482-2494.Edit
[2012-16] Groups and automata: a perfect match .
Heart Rate Variability in Children Submitted to Surgery. Journal of Anesthesia & Clinical Research. 2016;7.Edit
Free group languages: rational versus recognizable. Theor. Inform. Appl.. 2004;38:49-67.
Extensions and submonoids of automatic monoids. Theoret. Comput. Sci.. 2002;289:727-754.Edit
a partitional clustering algorithm validated by a clustering tendency index based on graph theory. pattern recognition. 2006;39:776-788.Edit
Luis Inacio Woodhouse (1857-1927). Vol 1. U. Porto Edições ed. 2018.Edit