29. Theorietag: Automaten und Formale Sprachen
Programm
All talks are in the room "Rotunde" of the building "Cartesium"
Important: Regular talks have 20min timeslots.
So your talk should be 18min + 2min questions!
Wednesday, 25.09.2019
18:00 Reception (room MZH 1470)
Thursday, 26.09.2019
09:00–10:00 Wim Martens, Optimization and Evaluation of Real-Life Graph Queries
10:00–10:30 Coffee
10:30–10:50
Dirk Nowotka, On Solution Sets of Word Equations
10:50–11:10
Andreas Malcher, On Iterated Uniform Finite State Transducers
11:10–11:30
Simon Beier, Semirecognizable Sets and Right One-Way Jumping Finite Automata
11:30–11:40 Break
11:40–12:00
Andreas Maletti, Tree Substitution Grammars
12:00–12:20
Louisa Seelbach-Benkner, Average Case Analysis of Leaf-Centric Binary Tree Sources
12:20–12:40
Aaron Lye, Generating Hypergraph Languages by (Context-dependent) Fusion Grammars and Splitting/Fusion Grammars
12:40–14:00 Lunch break
14:00–15:00 Mikołaj Bojańczik, Polyregular Functions
15:00–15:30 Coffee
15:30–15:50
Sebastian Siebertz, Structural Sparsity
15:50–16:10
Markus Lohrey, Balancing Straight-Line Programs
16:10–16:30
Jean Jung, Decidability and Complexity of ALCOIF with Transitive Closure
16:30–16:40 Break
16:40–17:00
Rudi Freund, Tissue P-Systems with Anti-Cells
17:00–17:20
Bianca Truthe, Accepting Networks of Evolutionary Processors with Resource Restricted Filters
17:20–17:40
Meenakshi Paramasivan, How Eulerian Trails are connected to Formal Languages?
17:50–18:30 GI Gruppentreffen
19:00 Kegeln (Goedekens Restaurant)
Friday, 27.09.2019
09:00–10:00 Thomas Schwentick, Dynamic Complexity: Recent and Complex Updates
10:00–10:30 Coffee
10:30–10:50
Henning Fernau, Erweiterungen zu kleinen synchronisierenden Wörtern
10:50–11:10
Petra Wolf, Computational Complexity of Synchronization under Regular Constraints
11:10–11:30 Hoffmann, Eigenschaften und Zustandskomplexität kommutativ regulärer Sprachen
11:30–11:40 Break
11:40–12:00
Florin Manea, Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
12:00–12:20
Christopher Hugenroth, Separating Languages over Infinite Words with Product Automata
12:20–12:40
Markus Schmid, Regular Expressions with Backreferences: Polynomial Time Matching Techniques
12:40–14:00 Lunch break