Publications
Simulation Based Design of Optimal Phasing Plans for an Intersection with Semi-Actuated Signals. In: Proceedings of the Twelfth International Conference on Civil, Structural and Environmental Engineering Computing.; 2009. 2. 246.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.
Francisco Gomes Teixeira. CIM Bulletin. 2004;16:21-23.Edit
[2015-41] On the circulation of algebraic knowledge in the Iberian península:the sources of Pérez de Moya's Tratado de Arithmetica (1573) .Edit
Automorphic orbits in free groups: words versus subgroups. Internat. J. Algebra Comput.. 2010;20:561-590.Edit
Normal-convex embeddings of inverse semigroups. Glasgow Math. J.. 1993;35:115-121.
Free group languages: rational versus recognizable. Theor. Inform. Appl.. 2004;38:49-67.
Finite automata for Schreier graphs of virtually free groups. J. Group Theory. 2016;19:25-54.Edit
Extensions and submonoids of automatic monoids. Theoret. Comput. Sci.. 2002;289:727-754.Edit
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
Dicionário de Matemática Elementar, de Stella Baruk. Vol 2 Edições Afrontamento 2005.Edit
[2017-28] On finitely generated submonoids of free groups .
On a class of automata groups generalizing lamplighter groups. Internat. J. Algebra Comput.. 2005;15:1213-1234.Edit
On the semilattice of idempotents of a free inverse monoid. Proc. Edinburgh Math. Soc. (2). 1993;36:349-360.