Programm

Montag, 22.09.2014
18:00 – 19:00 Anmeldung
ab 19:00 Abendessen



Dienstag, 23.09.2014
09:00 – 09:25 Anmeldung
09:25 – 09:30 Eröffnung des Workshops
09:30 – 10:30 Alexander Koller (Potsdam):
Parsing Expressive Grammar Formalisms with Tree Automata
10:30 – 11:00 Kaffeepause
11:00 – 12:00 Suna Bensch (Umeå):
Graph Transformation for Incremental Natural Language Analysis
12:00 – 14:30 Mittagspause
14:30 – 15:30 Falk Howar (Dortmund):
Active Automata Learning: From DFA to Interface Programs and Beyond
15:30 – 16:00 Kaffeepause
16:00 – 17:00 György Vaszil (Debrecen):
On the Descriptional Complexity of Grammars with Certain Types of Regulation
ab 18:00 Abendessen



Mittwoch, 24.09.2014
08:25 – 08:30 Eröffnung des Theorietags
08:30 – 09:00 Stefan Hoffmann
Topologische Verfeinerungen des Cantor-Raumes 2ω
09:00 – 09:30 Bianca Truthe
A Relation Between Definite and Ordered Finite Automata
09:30 – 10:00 Friedrich Otto
On the Descriptional Complexity of Deterministic Ordered Restarting Automata
10:00 – 10:30 Kaffeepause
10:30 – 11:00 Stephan Barth
Minmization Beyond Myhill-Nerode
11:00 – 11:30 Markus Holzer, Sebastian Jakobi, Matthias Wendlandt
On the Computational Complexity of Partial Word Automata Problems
11:30 – 12:00 Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid
Remarks on Jumping Finite Automata
12:00 – 12:30 Martin Kutrib, Adreas Malcher, Matthias Wendlandt
Deterministic Set Automata
12:30 – 14:00 Mittagspause
14:00 – 14:30 Jens Doll
Anforderungen an ein formales Esperanto II – Spezifikation einer allgemeinen formalen Sprache
14:30 – 15:00 Jürgen Dassow
Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources
15:00 – 15:30 Artiom Alhazov, Bogdan Aman, Rudolf Freund, Gheorghe Paun
P Systems with Anti-Matter
15:30 – 16:00 Kaffeepause
16:00 – 16:30 Christoph Matheja
Reconciling Decidability of Separation Logic Entailment and Graph Grammar Language Inclusion
16:30 – 17:00 Chris Köcher
Analyse der Entscheidbarkeit diverser Probleme in automatischen Graphen
17:00 – 17:30 Martin Huschenbett, Dietrich Kuske, Georg Zetschke
The Monoid of Queue Actions – A New (?) Monoid Worth to be Studied (?)
17:30 – 18:00 Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
Principal Trios, AFLs and Logarithmic Space
18:00 – 18:15 Pause
18:15 – 18:45 Sitzung der GI-Fachgruppe "Automaten und Formale Sprachen"
19:00 – 20:00 Abendessen
ab 20:00 Kegeln



Donnerstag, 25.09.2014
09:00 – 09:30 Henning Fernau
Gesteuerte Baumautomaten
09:30 – 10:00 Philipp Schlag
Mittels Antimirovs Ableitungen zu gewichteten Baumautomaten
10:00 – 10:30 Henning Bordihn, Paolo Bottoni, Anna Labella, Victor Mitrana
Solving 2D-Pattern Matching With Networks of Picture Processors
10:30 – 11:00 Kaffeepause
11:00 – 11:30 Markus L. Schmid
Characterising REGEX Languages by Regular Languages with Factor-Referencing
11:30 – 12:00 Dominik D. Freydenberger, Mario Holldack
Abschnittsanfragen und formale Sprachen
12:00 – 12:30 Natasha Janoska, Florin Manea, Shinnosuke Seki
News on the Square Conjecture
12:30 Verabschiedung und Mittagessen