Publications
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
Prefix and Right-Partial Derivative Automata. In: Soskova M, Mitrana V, editors. Computability in Europe (CiE 2015). Springer; 2015. 2. p. 258-267p. 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
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
On the Mother of All Automata: the Position Automaton. In: Developments in Language Theory.; 2017. 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
Implementation of Code Properties via Transducers. In: Implementation and Application of Automata, 21th International Conference (CIAA 2016).; 2016. Edit
Generating Error Control Codes With Automata and Transducers. 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. 2. p. 211-226p. 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
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
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 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
Automata Serialization for Manipulation and Drawing. In: Mernik M, Leal JPaulo, Oliveira HGonçalo, editors. 5th Symposium on Languages, Applications and Technologies (SLATE'16). Vol 51. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik; 2016. 1. p. 1-7p. (OpenAccess Series in Informatics (OASIcs); vol 51).Edit
Symmetric Groups and Quotient Complexity of Boolean Operations. Vol 8573. Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E, editors 2014.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
On the Equivalence of Automata for KAT-expressions. Vol 8493. Beckmann A, Csuhaj-Varjú E, Meer K, editors 2014.Edit