![]() |
Stefan GulanTheoretical Computer ScienceComputer Science Department University of Trier |
| Navigation | Contact | Publications | Research | Teaching |
| Contact Details | ||||||||||||
|
| Research interests | |
| Formal Languages, Graph Transformation |
| Publications | |
| Elimination Strategies for converting FAs to Regular Expresissions, In Theory and Practice of Computer Science: SOFSEM 2008; volume II, pages 46-57. Institute of Computer Science, Faculty of Science, Pavol Jozef Safarik University, Kosice, Slovakia, 2008. | |
| Top-Down Construction of Finite Automata from Regular Expressions, Technical Report |
| Courses | ||
|---|---|---|
| Winter Term 06/07 | : | Exercises Diskrete Strukturen und Logik |
| Summer Term 07 | : | Exercises Formale Sprachen |
| Exercises Petrinetze | ||
| Workshop Alles Logo | ||
| Winter Term 07/08 | : | Exercises Diskrete Strukturen und Logik |
| Summer Term 08 | : | Exercises Formale Sprachen |
| Exercises Lernalgorithmen |