Publications
Numerical relations and skill level constrain co-adaptive behaviors of agents in sports teams. PloS one. 2014;9:e107112.Edit
Free group languages: rational versus recognizable. Theor. Inform. Appl.. 2004;38:49-67.
a partitional clustering algorithm validated by a clustering tendency index based on graph theory. pattern recognition. 2006;39:776-788.Edit
Extensions and submonoids of automatic monoids. Theoret. Comput. Sci.. 2002;289:727-754.Edit
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.
Finite idempotent inverse monoid presentations. Internat. J. Algebra Comput.. 2011;21:1111-1133.
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
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
[2012-16] Groups and automata: a perfect match .
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.
[2017-28] On finitely generated submonoids of free groups .
The word problem for nilpotent inverse monoids. Semigroup Forum. 1995;51:285-293.
Fixed points of endomorphisms of virtually free groups. Pacific J. Math.. 2013;263:207-240.