Publications
Nonhomogeneous patterns on numerical semigroups. Internat. J. Algebra Comput.. 2013;23:1469-1483.Edit
Patterns on numerical semigroups. Linear Algebra Appl.. 2006;414:652-669.Edit
ranking learning algorithms: using ibl and meta-learning on accuracy and time results. machine learning. 2003;50:251-277.Edit
Alphabetical satisfiability problem for trace equations. Acta Cybernetica. 2009;19(2):479-497.Edit
[2014-6] Bias corrected geometric-type estimators .
[2005-39] Weak convergence of a bootstrap geometric-type estimator with applications to risk theory .
Weak convergence of a bootstrap geometric-type estimator with applications to risk theory. Insurance Math. Econom.. 2006;38:571-584.
Limiting behaviour of a geometric-type estimator for tail indices. Insurance Math. Econom.. 2003;33:211-226.
Tail prepivoting for the Hill estimator. J. Phys. A. 2016;49:194004, 12.
[2015-15] Modelling of extremal earthquakes .
Edgeworth expansion for an estimator of the adjustment coefficient. Insurance Math. Econom.. 2008;43:203-208.
[2016-14] Tail prepivoting for the hill estimator .
Bias-corrected geometric-type estimators of the tail index. J. Phys. A. 2016;49:214003, 30.
Consistent estimation of the tail index for dependent data. Statist. Probab. Lett.. 2010;80:1835-1843.
Modelling of extremal earthquakes. Vol Mathematics of Energy and Climate Change Springer 2015.
Sur l'encadrement optimal presque sûr dans un échantillon ordonné. C. R. Acad. Sci. Paris Sér. I Math.. 1986;303:821-824.
Partial Derivative Automaton for Regular Expressions with Shuffle. In: Shallit J, Okhotin A, editors. Proceedings of the 17th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS15). Springer; 2015. 2. p. 21-32p. Edit
Position automaton construction for regular expressions with intersection. In: Reutenauer C, Brlek S, editors. Developments in Language Theory - 20th International Conference, DLT 2016. Vol 9840. Springer; 2016. 5. p. 51-63p. Edit
On the Average Complexity of Strong Star Normal Form. In: Pighizzini G, Câmpeanu C, editors. Description Complexity of Formal Systems (DCFS 2017). Vol 10316. Springer; 2017. 7. p. 77-88p. (LNCS; vol 10316).Edit
The average transition complexity of Glushkov and partial derivative automata. In: Developments in language theory. Vol 6795. Springer, Heidelberg; 2011. 9. p. 93-104p. (Lecture Notes in Comput. Sci.; vol 6795).Edit
[2014-35] Automata for KAT Expressions DCC-FC, Universidade do Porto .
On the Mother of All Automata: the Position Automaton. In: Developments in Language Theory.; 2017. Edit
On the Equivalence of Automata for KAT-expressions. Vol 8493. Beckmann A, Csuhaj-Varjú E, Meer K, editors 2014.Edit