Montag, 26.9.2011 | |
18:00 – 19:00 | Anmeldung |
ab 19:00 | Abendessen |
Dienstag, 27.9.2011 | |
09:00 – 09:25 | Anmeldung |
09:25 – 09:30 | Eröffnung des Workshops |
09:30 – 10:30 |
Manfred Droste (Dresden): Weighted Automata and Quantitative Logics |
10:30 – 11:00 | Kaffeepause |
11:00 – 12:00 | Frank Drewes (Umeå): Varianten eines Algorithmus zum Lernen von Baumreihen |
12:00 – 14:00 | Mittagspause |
14:00 – 15:00 | Georg Zetzsche (Kaiserslautern): Recent Results on Erasing in Regulated Rewriting |
15:00 – 15:15 | Pause |
15:15 – 16:15 | Serghei Verlan (Paris): An Overview of Insertion-Deletion Systems |
16:15 – 16:45 | Kaffeepause |
16:45 – 17:45 | Florin Manea (Bukarest): Turing Machines Deciding According to the Shortest Computations and Deciding Networks of Evolutionary Processors |
ab 18:00 | Abendessen |
Mittwoch, 28.9.2011 | |
08:25 – 08:30 | Eröffnung des Theorietags |
08:30 – 09:00 | Henning Fernau, Ralf Stiebe: Über CD Grammatiksysteme mit Valenzregeln |
09:00 – 09:30 | Georg Zetzsche Monoid Control for Grammars, Automata, and Transducers |
09:30 – 10:00 | Jürgen Dassow, Florin Manea, Bianca Truthe Netze evolutionärer Prozessoren mit subregulären Filtern |
10:00 – 10:30 | Kaffeepause |
10:30 – 11:00 | Rudolf Freund: A General Framework for Regulated Rewriting |
11:00 – 11:30 | Karin Quaas: On the Interval-Bound Problem for Weighted Timed Automata |
11:30 – 12:00 | Florin Manea, Robert Mercaş, Cătălin Tiseanu: On Periodic Partial Words |
12:00 – 12:30 | Florin Manea, Robert Mercaş, Cătălin Tiseanu: Algorithms and Pseudo-Periodicity in Words |
12:30 – 14:00 | Mittagspause |
14:00 – 14:30 | Norbert Hundeshagen, Friedrich Otto: Restarting Automata and Rational Relations |
14:30 – 15:00 | Stanislav Basovník, Frantiek Mráz: Learning Limited Context Restarting Automata by Genetic Algorithms |
15:00 – 15:30 | Daniel Reidenbach, Markus L. Schmid Automata for Languages Defined by Backreferencing |
15:30 – 16:00 | Kaffeepause |
16:00 – 16:30 | Markus Holzer, Sebastian Jakobi: Chop Operations and Expressions: Descriptional Complexity Considerations |
16:30 – 17:00 | Stefan Gulan: Unäre Operatoren in regulären Ausdrücken |
17:00 – 17:30 | Dominik D. Freydenberger: Entscheidungsprobleme für erweiterte reguläre Ausdrücke |
17:30 – 18:00 | Martin Kutrib, Matthias Wendlandt: String Assembling Systems |
18:00 – 18:15 | Pause |
18:15 – 18:45 | Sitzung der GI-Fachgruppe "Automaten und Formale Sprachen" |
ab 19:00 | Abendessen, anschließend Kegeln |
Donnerstag, 29.9.2011 | |
08:00 – 08:30 | Stephan Barth, Martin Hofmann: SAT-basiertes Minimieren von Büchi-Automaten |
08:30 – 09:00 | Benedek Nagy, Friedrich Otto, Marcel Vollweiler: Pushdown Automata with Translucent Pushdown Symbols |
09:00 – 09:30 | Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Descriptional Complexity of Two-Way Pushdown Automata With Restricted Head Reversals |
09:30 – 10:00 | Marian Kogler: On the Complexity of Pushdown Transducers and Two-Way Transducers |
10:00 – 10:30 | Kaffeepause |
10:30 – 11:00 | Ronny Harbich: Beschreibungskomplexität kontextfreier Sprachen bezüglich der AFL-Operationen |
11:00 – 11:30 | Markus Holzer, Martin Kutrib, Katja Meckel: Nondeterministic State Complexity of Star-Free Languages |
11:30 – 12:00 | Hendrik Radke: HR* Graph Conditions Versus Counting Monadic Second-Order Graph Formulas |
12:00 | Verabschiedung und Mittagessen |