| Programm | |
| Montag, 29. September 2008 | |
| Nachmittags | Anreise |
| 18.00 - | Abendessen |
| Workshop "Selected Topics in Theoretical Computer Science" | |
| Dienstag, 30. September 2008 | |
| Breakfast | |
| 09.25 - 09.30 | Opening |
| 09.30 - 10.30 |
Maurice Margenstern (Metz, France): About the injectivity of the global function of cellular automata in the hyperbolic plane |
| 10.30 - 11.00 | Coffee break |
| 11.00 - 12.00 | György Vaszil (Budapest, Hungary): Symport/Antiport Systems and P Automata - Membrane Systems for the Characterization of Formal Languages |
| 12.00 - 14.00 | Lunch |
| 14.00 - 15.00 | Viliam Geffert (Košice, Slovakia), Carlo Mereghetti, Beatrice Palano (Milan, Italy): Descriptional Complexity Issues Concerning Regular Languages |
| 15.00 - 15.30 | Coffee break |
| 15.30 - 16.30 | Andreas Klein (Ghent, Belgium): Visuelle Kryptographie |
| 18.00 - | Dinner |
| Theorietag "Automaten und Formale Sprachen" | |
| Mittwoch, 1. Oktober 2008 | |
| Frühstück | 08.55 - 09.00 | Begrüßung |
| 09.00 - 09.30 | Tobias Richter, Ludwig Staiger (Halle): Topological Language Operators |
| 09.30 - 10.00 | Rudolf Freund (Wien), Sergey Verlan (Paris): (Tissue) P Systems Working in the k-Restricted Minimally Parallel Mode |
| 10.00 - 10.30 | Remco Loos (Hinxton), Andreas Malcher
(Gießen), Detlef Wotschke (Frankfurt): Some Results on the Descriptional Complexity of Splicing Systems |
| 10.30 - 11.00 | Kaffeepause |
| 11.00 - 11.30 | Bianca Truthe (Magdeburg): Zu akzeptierenden Netzwerken evolutionärer Prozessoren mit zwei Knotenarten |
| 11.30 - 12.00 | Anna Kasprzik (Trier): Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees |
| 12.00 - 13.30 | Mittagessen |
| 13.30 - 14.00 | Martin Kutrib (Gießen), Hartmut
Messerschmidt, Friedrich Otto (Kassel): On Stateless Restarting Automata |
| 14.00 - 14.30 | Dana Pardubská (Bratislava), Martin Plátek (Prague): Formal Translations, Parallel Communicating Grammar Systems and Restarting Automata |
| 14.30 - 15.00 | Hartmut Messerschmidt (Kassel): On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone |
| 15.00 - 15.30 | Kaffeepause |
| 15.30 - 16.00 | Alexander Okhotin (Turku), Christian
Reitwießner (Würzburg): Conjunctive grammars with restricted disjunction |
| 16.00 - 16.30 | Dominik D. Freydenberger (Frankfurt), Daniel Reidenbach (Loughborough): Inklusionsprobleme für Patternsprachen |
| 16.30 - 17.00 | Johannes C. Schneider (Kaiserslautern): Eindeutige löschende Homomorphismen in freien Monoiden |
| 17.00 - 17.15 | Pause |
| 17.15 - 18.00 | Fachgruppensitzung |
| 18.00 - | Abendessen |
| Donnerstag, 2. Oktober 2008 | |
| Frühstück | |
| 09.00 - 09.30 | Henning Fernau (Trier), Ralf Stiebe (Magdeburg): Blinde Zählerautomaten auf ω-Wörtern |
| 09.30 - 10.00 | Henning Bordihn (Potsdam), Martin Kutrib,
Andreas Malcher (Gießen): On the Computational Capacity of Parallel Communicating Finite Automata |
| 10.00 - 10.30 | Hermann Gruber (Gießen), Jan Johannsen (München): Communication Complexity and Regular Expression Size |
| 10.30 - 11.00 | Kaffeepause |
| 11.00 - 11.30 | Stefan Gulan, Henning Fernau (Trier): Konstruktion endlicher Automaten aus regulären Ausdrücken |
| 11.30 - 12.00 | Hermann Gruber, Markus Holzer (Gießen): Language Operations with Regular Expressions of Polynomial Size |
| 12.00 - 13.30 | Mittagessen |
| 13.30 | Abreise |