Publications
[2014-36] Derivative Based Methods for Deciding SKA and SKAT DCC-FC & CMUP, Universidade do Porto .Edit
The Distinguishability Operation on Regular Languages. In: Non-Classical Models of Automata and Applications (NCMA 2014).; 2014. Edit
On the Equivalence of Automata for KAT-expressions. Vol 8493. Beckmann A, Csuhaj-Varjú E, Meer K, editors 2014.Edit
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. Theoret. Comput. Sci.. 2014;528:85-100.Edit
Incremental DFA Minimisation. RAIRO - Theoretical Informatics and Applications. 2014;48:173-186.Edit
[2014-37] Kleene Algebra Completeness DCC-FC & CMUP, Universidade do Porto .Edit
Partial Derivative and Position Bisimilarity Automata. Vol 8587. Holzer M, Kutrib M, editors SV 2014 (LNCS; vol 8587).Edit
Symmetric Groups and Quotient Complexity of Boolean Operations. Vol 8573. Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E, 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.
Incomplete Transition Complexity of Basic Operations on Finite Languages. Konstantinidis S, editor 2013.Edit
Incomplete Transition Complexity of some Basic Operations. Boas Pvan Emde, Groen FCA, Italiano GF, Nawrocki J, Sack H, editors 2013.Edit
Preface. Special Issue - Implementation and Application of Automata (CIAA 2012). International Journal of Fundations of Computer Science. 2013;24:689-690.
On the Average Size of Glushkov and Partial Derivative Automata. International Journal of Foundations of Computer Science. 2012;23:969-984.
Descriptional Complexity of Formal Systems, 14th International Workshop (DCFS 2012). Vol 7386. Kutrib M, Moreira N, Reis R, editors Springer 2012.Edit
Implementation and Application of Automata, 17th International Conference (CIAA 2012). Vol 7381. Moreira N, Reis R, editors Springer 2012.
On the Average State Complexity of Partial Derivative Automata: an analytic combinatorics approach. International Journal of Foundations of Computer Science. 2011;22:1593-1606.
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
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