Publications
Found 172 results
[ Author] Title Type Year Filters: First Letter Of Last Name is R [Clear All Filters]
Is autonomic control of the heart rate at rest altered by detraining? A study of heart rate variability in professional soccer players. {Revista portuguesa de cardiologia : orgão oficial da Sociedade Portuguesa de Cardiologia = Portuguese journal of cardiology : an official journal of the Portuguese Society of Cardiology}. 1997;{16}:{535-541, 508}.Edit
empirical evaluation of ranking trees on some metalearning problems. aaai workshop - technical report. 2008;ws-08-09:85-90.Edit
Discrete orbits, recurrence and solvable subgroups of Diff(C^2,0). Journal of Geometric Analysis. 2017;27(1):1-55.Edit
[2007-12] Intuicionismo e Teoria de Categorias/Topos. Tempo Linguagens e Limites Cognitivos em Matemática. .Edit
[2007-11] O Teorema de Banach-Tarski: Paradoxo ou Ilusão? O Axioma da Escolha: status quo, defesa e crítica. .Edit
HIV screening in tuberculosis patients, in the Northern Region of Portugal. The International Journal of Tuberculosis and Lung Disease. 2015;19(12).Edit
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.
Ideal regular languages and strongly connected synchronizing automata. Theoretical Computer Science. 2016;653:97-107.
Semi-complete foliations associated to Hamiltonian vector fields in dimension 2. J. Math. Anal. Appl.. 2007;328(2):813-820.
[2005-22] Equivalence and semi-completude of foliations .
Regular Ideal Languages and Synchronizing Automata. In: Combinatorics on Words, WORDS 2013. Vol LNCS, 8079.; 2013. 2. p. 205-216p.
Semi-complete vector fields of saddle-node type in C^n. Trans. Amer. Math. Soc.. 2008;360(12):6611-6630.
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.
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
Turing machines and bimachines. Theoret. Comput. Sci.. 2008;400:182-224.Edit
Further results on monoids acting on trees. Internat. J. Algebra Comput.. 2012;22:1250034, 69.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