Rito C. Some bidouble planes with $p_g=q=0$ and $4\leq K^2\leq 7$. International Journal of Mathematics. 2015;26(5).

[2013-19] Rito C. Surfaces with $p_g=0,$ $K^2=3$ and 5-torsion .

[2015-18] Rito C. A surface with $q=2$ and canonical map of degree $16$ .

Rito C.. A surface with canonical map of degree 24. International Journal of Mathematics. 2017;28(6).Edit

Ribeiro C., Ladeira I., Gaio A., Brito MC. 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

Rhodes J, Schilling A, Silva PV. The semaphore codes attached to a Turing machine via resets and their various limits. Internat. J. Algebra Comput.. 2016;26(4):675-704.Edit

[2006-46] Rhodes J, Silva PV. An algebraic analysis of Turing machines and Cook’s Theorem leading to a profinite fractal different .Edit

Rhodes J, Silva PV. Turing machines and bimachines. Theoret. Comput. Sci.. 2008;400:182-224.Edit

[2012-8] Rhodes J, Silva PV. A new notion of vertex independence and rank for .Edit

Rhodes J, Schilling A, Silva PV. Random walks on semaphore codes and delay de Bruijn semigroups. Internat. J. Algebra Comput.. 2016;26(4):635-673.Edit

Rhodes J, Silva PV. Boolean Representations of Simplicial Complexes and Matroids. Vol Springer Monographs in Mathematics Springer 2015.Edit

[2015-22] Rhodes J, Schilling A, Silva PV. Random walks on semaphore codes and delay de Bruijn semigroups .Edit

[2016-7] Rhodes J, Schilling A, Silva PV. The semaphore codes attached to a Turing machine via resets and their various limits .Edit

[2011-5] Rhodes J, Silva PV. Further results on monoids acting on trees .Edit

Rhodes J, Silva PV. A new notion of vertex independence and rank for finite graphs. Internat. J. Algebra Comput.. 2015;25(1-2):123-167.Edit

Rhodes J, Silva PV. Further results on monoids acting on trees. Internat. J. Algebra Comput.. 2012;22:1250034, 69.Edit

Restivo A, Silva PV. Periodicity vectors for labelled trees. Discrete Appl. Math.. 2003;126:241-260.Edit

Restivo A, Silva PV. On the lattice of prefix codes. Theoret. Comput. Sci.. 2002;289:755-782.Edit

Reis R, Rodaro E. Ideal regular languages and strongly connected synchronizing automata. Theoretical Computer Science. 2016;653:97-107.

Reis H. Equivalence and semi-completude of foliations. Nonlinear Analysis. Theory, Methods & Applications. 2006;64(8):1654-1665.

Reis R, Rodaro E. 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.

[2005-22] Reis H. Equivalence and semi-completude of foliations .

Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. Karhumäki J, Zamboni L, editors 2013.Edit

Reis R, Rodaro E. 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.

Reis H. Semi-complete foliations associated to Hamiltonian vector fields in dimension 2. J. Math. Anal. Appl.. 2007;328(2):813-820.