Publications
Integral Appell $F_3$-transformation with respect to parameters. In: Complex analysis and applications '85 (Varna, 1985). Publ. House Bulgar. Acad. Sci., Sofia; 1986. 1. p. 135-140p. Edit
Partitions of a finite Boolean lattice into intervals. European J. Combin.. 2009;30:1801-1809.Edit
[2008-41] Equilibrium staes for interval maps: potentials with $\sup \phi - \inf \phi < \htop(f)$ .Edit
[2007-24] Return time statistics for invariant measures for interval maps with positive Lyapounov exponent .Edit
On the Average State Complexity of Partial Derivative Automata: an analytic combinatorics approach. International Journal of Foundations of Computer Science. 2011;22:1593-1606.
Automata for Regular Expressions with Shuffle. Information and Computation. 2017.
On the average number of states of partial derivative automata. In: Developments in language theory. Vol 6224. Springer, Berlin; 2010. 1. p. 112-123p. (Lecture Notes in Comput. Sci.; vol 6224).Edit
[2014-36] Derivative Based Methods for Deciding SKA and SKAT DCC-FC & CMUP, Universidade do Porto .Edit
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 Average Size of Glushkov and Partial Derivative Automata. International Journal of Foundations of Computer Science. 2012;23:969-984.
On the Equivalence of Automata for KAT-expressions. Vol 8493. Beckmann A, Csuhaj-Varjú E, Meer K, editors 2014.Edit
On the Average Size of Glushkov and Equation Automata for KAT Expressions. In: FCT. United Kingdom, Liverpool: Springer; 2013. 7. p. 72-83p.
Average Size of Automata Constructions from Regular Expressions. Bulletin of the European Association for Theoretical Computer Science. 2015:167-192.Edit
Deciding Synchronous Kleene Algebra with Derivatives. In: Drewes F, editor. Implementation and Application of Automata, 20th International Conference (CIAA 2015). Vol 9223.; 2015. 4. p. 49-62p. (LNCS; vol 9223).Edit
The Average Transition Complexity of Glushkov and Partial Derivative Automata. In: Mauri G., Leporati A., editors. Developments in Language Theory, 15th International Conference, DLT 2011, Milano, Italy, July 2011. Proceedings. Vol 6795. Milano, Italy; 2011. 9. p. 93-104p. Edit