Publications
A surface with canonical map of degree 24. International Journal of Mathematics. 2017;28(6).Edit
Cuspidal quintics and surfaces with $p_g=0,$ $K^2=3$ and 5-torsion. LMS Journal of Computation and Mathematics. 2016;19(1):42-53.
[2015-20] A surface with canonical map of degree $24$ .
Pneumococcal pneumonia-are the new severity scores more accurate in predictingadverse outcomes? [Pneumonia pneumocócica-serão os novos scoresmais precisos a prever eventos desfavoráveis?]. Revista Portuguesa de Pneumologia. 2013;19:252-259.Edit
Random walks on semaphore codes and delay de Bruijn semigroups. Internat. J. Algebra Comput.. 2016;26(4):635-673.Edit
[2006-46] An algebraic analysis of Turing machines and Cook’s Theorem leading to a profinite fractal different .Edit
Boolean Representations of Simplicial Complexes and Matroids. Vol Springer Monographs in Mathematics Springer 2015.Edit
Further results on monoids acting on trees. Internat. J. Algebra Comput.. 2012;22:1250034, 69.Edit
A new notion of vertex independence and rank for finite graphs. Internat. J. Algebra Comput.. 2015;25(1-2):123-167.Edit
The semaphore codes attached to a Turing machine via resets and their various limits. Internat. J. Algebra Comput.. 2016;26(4):675-704.Edit
Turing machines and bimachines. Theoret. Comput. Sci.. 2008;400:182-224.Edit
On the lattice of prefix codes. Theoret. Comput. Sci.. 2002;289:755-782.Edit
Periodicity vectors for labelled trees. Discrete Appl. Math.. 2003;126:241-260.Edit
Semi-complete vector fields of saddle-node type in C^n. Trans. Amer. Math. Soc.. 2008;360(12):6611-6630.
Ideal regular languages and strongly connected synchronizing automata. Theoretical Computer Science. 2016;653:97-107.
Reset Regular Decomposition Complexity of Regular Ideal Languages (extended Abstract). In: Proceedings of 14th Italian Conference on Theoretical Computer Science.; 2013. 3. p. 30-35p.
Equivalence and semi-completude of foliations. Nonlinear Analysis. Theory, Methods & Applications. 2006;64(8):1654-1665.
[2005-22] Equivalence and semi-completude of foliations .
The Language of Initially Connected Deterministic Finite Automata (Extended Abstract). In: Proceedings of 14th Italian Conference on Theoretical Computer Science.; 2013. 1. p. 179-184p.