Publications
Local Elimination-Strategies in Automata for shorter Regular Expresissions
presented at SOFSEM08, Student Research Forum
Top-Down Construction of Finite Automata from Regular Expressions, Technical Report
An Optimal Construction of Finite Automata from Regular Expressions, FSTTCS '08, Bangalore
-> full version
Simplifying Regular Expression: A Quantitative Perspective [with H. Gruber], LATA '10, Trier
Series-Parallel Graphs with Loops: Graphs Encoded by Regular Expressions, STACS '11, Dortmund ; heavily extended version (draft for special issue of TOCS, updated): here
My Thesis: On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
