Publications
Symmetric Groups and Quotient Complexity of Boolean Operations. Vol 8573. Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E, editors 2014.Edit
A Survey on Operational State Complexity. Journal of Automata, Languages and Combinatorics. 2017;21:251-310.Edit
On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection. In: Proceedings of the 18th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS16). Vol 9777. Springer; 2016. 4. p. 45-59p. (LNCS; vol 9777).Edit
The Role of Theory in Computer Science: Essays Dedicated to Janusz Brzozowski. Konstantinidis S, Moreira N, Reis R, Shallit J, editors World Scientific 2017.Edit
Prefix and Right-Partial Derivative Automata. In: Soskova M, Mitrana V, editors. Computability in Europe (CiE 2015). Springer; 2015. 2. p. 258-267p. Edit
Preface. Special Issue - Implementation and Application of Automata (CIAA 2012). International Journal of Fundations of Computer Science. 2013;24:689-690.
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
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
Partial Derivative and Position Bisimilarity Automata. Vol 8587. Holzer M, Kutrib M, editors SV 2014 (LNCS; vol 8587).Edit
Optimal State Reductions of Automata with Partially Specified Behaviors. Theoretical Computer Science. 2017;658:235-245.Edit
Optimal State Reductions of Automata with Partially Specified Behaviors Springer 2015 (LNCS).Edit
On the Mother of All Automata: the Position Automaton. In: Developments in Language Theory.; 2017. Edit
[2014-37] Kleene Algebra Completeness DCC-FC & CMUP, Universidade do Porto .Edit
Incremental DFA Minimisation. In: Domaratzki M, Salomaa K, editors. Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA 2010). Winnipeg, MA, Canada; 2011. 3. p. 39-48p. Edit
Incremental DFA Minimisation. RAIRO - Theoretical Informatics and Applications. 2014;48:173-186.Edit
Incomplete Transition Complexity on Finite and Infinite Regular Languages. Information and Computation. 2015;244:1-22.Edit
Incomplete Transition Complexity of some Basic Operations. Boas Pvan Emde, Groen FCA, Italiano GF, Nawrocki J, Sack H, editors 2013.Edit
Incomplete Transition Complexity of Basic Operations on Finite Languages. Konstantinidis S, editor 2013.Edit
Implementation of Code Properties via Transducers. In: Implementation and Application of Automata, 21th International Conference (CIAA 2016).; 2016. Edit