Publications
Implementation and Application of Automata, 17th International Conference (CIAA 2012). Vol 7381. Moreira N, Reis R, editors Springer 2012.
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. Theoret. Comput. Sci.. 2014;528:85-100.Edit
On the Equivalence of Automata for KAT-expressions. Vol 8493. Beckmann A, Csuhaj-Varjú E, Meer K, editors 2014.Edit
Distinguishability Operations and Closures. Fundamenta Informaticae. 2016;148:243-266.Edit
The Distinguishability Operation on Regular Languages. In: Non-Classical Models of Automata and Applications (NCMA 2014).; 2014. Edit
On the Dissimilarity Operation on Finite Languages. In: Bordihn H, Freund R, Nagy B, Vaszil G, editors. Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016). Österreichische Computer Gesellschaft; 2016. 1. p. 105-120p. Edit
Descriptional Complexity of Formal Systems, 14th International Workshop (DCFS 2012). Vol 7386. Kutrib M, Moreira N, Reis R, editors Springer 2012.Edit
[2014-36] Derivative Based Methods for Deciding SKA and SKAT DCC-FC & CMUP, Universidade do Porto .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: 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
On the Average State Complexity of Partial Derivative Automata: an analytic combinatorics approach. International Journal of Foundations of Computer Science. 2011;22:1593-1606.
On the Average Size of Glushkov and Partial Derivative Automata. International Journal of Foundations of Computer Science. 2012;23:969-984.
On the Average Size of Glushkov and Equation Automata for KAT Expressions. In: FCT. United Kingdom, Liverpool: Springer; 2013. 7. p. 72-83p.
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
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
On the Average Complexity of Partial Derivative Automata for Semi-Extended Expressions. Journal of Automata, Languages and Combinatorics. 2017;22:5-28.Edit