Formale Sprachen, Beschreibungskomplexität, Graphen

Local Elimination-Strategies in Automata for shorter Regular Expresissions
SOFSEM08, Student Research Forum

Top-Down Construction of Finite Automata from Regular Expressions, Forschungsbericht

An Optimal Construction of Finite Automata from Regular Expressions, FSTTCS '08, Bangalore

-> ausführliche Version

Simplifying Regular Expression: A Quantitative Perspective [mit H. Gruber], LATA '10, Trier

Series-Parallel Graphs with Loops: Graphs Encoded by Regular Expressions, STACS '11, Dortmund

-> ausführliche Version (STACS - Sonderband)

Meine Dissertation: On the Relative Descriptional Complexity of Regular Expressions and Finite Automata

• Sommer 12: Formale Sprachen, GTI1
• Winter 11/12: GTI2
• Sommer 11:  Datenkompression, Formale Sprachen
• Winter 10/11:  Berechenbarkeit und Logik, GTI2
  
• Sommer 10:  Formale Sprachen, GTI, GTI3
• Winter 09/10: GTI2, Parametrisierte Algorithmen
• Sommer 09: GTI3
• Winter 08/09: Datenkompression, GTI2
• Sommer 08:  Formale Sprachen, Lernalgorithmen
• Sommer 07:  Formale Sprachen, Petrinetze, Workshop Alles Logo
• Winter 06/07:  Diskrete Strukturen und Logik