Programme

10:20 - 10:50 | Registration & coffee

10:50 - 11:00 | Opening 

11:00 - 12:00 | Invited talk unifying NCMA and DCFS | Chair: Luca Prigioniero

Inductive Inference of Lindenmayer Systems: Computational and Descriptional Complexity
Ian McQuillan

12:00 - 13:30 | Lunch

13:30 - 15:00 | Contributed talks | Chair: Ian McQuillan

• Forecasting Blow-Up in Nondeterministic Automata
  Ivan Baburin and Ryan Cotterell
• Two-Word Shuffle: Some Results
  Guilherme Duarte, Nelma Moreira and Rogério Reis
• Disjunctive Complexity
  Nikita Ivanov, Alexander Rubtsov and Mikhail Vyalyi

15:00 - 15:30 | Coffee break

15:30 - 17:00 | Contributed talks | Chair: Rogério Reis

• On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words
  Friedrich Otto and František Mráz
  
• Two-Way Finite Automata with Translucent Input Letters
  Martin Kutrib, Andreas Malcher, Carlo Mereghetti and Beatrice Palano
• k-Local Graphs 
  Christian Beth, Pamela Fleischmann, Annika Huch, Daniyal Kazempour, Peer Kröger, Andrea Kulow and Matthias Renz

17:00 - 17:30 | Business meeting

09:00 - 10:00 | Invited talk | Chair: Martin Kutrib

Wheeler Automata in Formal Language Theory
Giuseppa Castiglione

10:00 - 10:30 | Coffee break

10:30 - 12:00 | Contributed talks | Chair: Giuseppa Castiglione

• Word-Representable Graphs and Locality of Words
  Philipp Böll, Pamela Fleischmann, Annika Huch, Jana Kreiß, Tim Löck, Kajus Park and Max Wiedenhöft
• On the Decidability and Expressive Power of Several Theories Based on String Constraints
  Justus Greve-Kramer, Tore Koß, Florin Manea and Timo Specht
• Fibonacci Pictures on a Binary Alphabet
  Marcella Anselmo, Dora Giammarresi, Maria Madonia and Carla Selmi

12:00 - 13:30 | Lunch

13:30 - 22:00 | Social activities

09:00 - 10:00 | Invited talk  | Chair: György Vaszil

Descriptional Complexity in Natural Computing: the Case of P Systems
Erzsébet Csuhaj-Varjú

10:00 - 10:30 | Coffee break

10:30 - 12:00 | Contributed talks | Chair: Erzsébet Csuhaj-Varjú

• Small Balanced Vertex Separators in NFA to Regular Expression Conversion
  Derek Youngman and Kai Salomaa
• Automata for Synchronised Shuffle on Backbones
  Sabine Broda, António Machiavelo, Nelma Moreira and Rogério Reis
• Relative Densities of Formal Languages
  Juan Montoya

12:00 - 13:30 | Lunch

13:30 - 14:30 | Invited Talk | Chair: Andreas Malcher

Can We Efficiently Compute Concurrency and Causality Relations in the Reversible Setting?
Irek Ulidowski

14:30 - 15:00 | Coffee break

15:30 - 16:30 | Contributed talks | Chair: Andreas Malcher

• What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?
  Tomoyuki Yamakami
• Matrix Forbidding Grammars
  Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman and György Vaszil
• Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete
  Martin Havel, Alexander Meduna and Zbyněk Křivka

16:30 - 17:00 | Closing