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 a class of automata groups generalizing lamplighter groups. Internat. J. Algebra Comput.. 2005;15:1213-1234.Edit
Finite automata for Schreier graphs of virtually free groups. J. Group Theory. 2016;19:25-54.Edit
On the semilattice of idempotents of a free inverse monoid. Proc. Edinburgh Math. Soc. (2). 1993;36:349-360.
Finite idempotent inverse monoid presentations. Internat. J. Algebra Comput.. 2011;21:1111-1133.
Rational subsets of partially reversible monoids. Theoret. Comput. Sci.. 2008;409:537-548.
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
[2010-14] Finite idempotent inverse monoid presentations .
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.
Fixed points of endomorphisms over special confluent rewriting systems. Monatsh. Math.. 2010;161:417-447.
Luis Inacio Woodhouse (1857-1927). Vol 1. U. Porto Edições ed. 2018.Edit
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.