Monday, 21 July

08:30 - 08:50 | Registration

08:50 - 09:00 | Opening

09:30 - 10:30 | Contributed talks | Chair: Nelma Moreira

  • An Orchestration of Music by Grammar Systems
    Jozef Makiš, Zbyněk Křivka and Alexander Meduna
  • Idefix-Closed Languages and Their Application in Contextual Grammars
    Marvin Ködding and Bianca Truthe

10:30 - 11:00 | Coffee break

11:00 - 11:30 | Invited talk | Chair: Nelma Moreira

Weighted automata and cost register automata: (Un)Decidability
Laure Daviaud

12:00 - 13:30 | Lunch

13:30 - 14:50 | Contributed and informal talks |  Chair: Zbyněk Křivka

  • On a Generalization of the Christoffel Tree: Epichristoffel Trees
    Abhishek Krishnamoorthy, Robinson Thamburaj and Durairaj Gnanaraj Thomas
  • On some Classes of Reversible 2-head Automata
    Benedek Nagy and Walaa Yasin
  • [Informal talk] k-Universality of Regular Languages Revisited 
    Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß and Florin Manea 

14:50 - 15:20 | Coffee break

15:20 - 16:40 | Contributed and informal talks |  Chair: Robert Mercaş

  • On Repetitive Finite Automata with Translucent Words
    Friedrich Otto and František Mráz
  • Input-Driven Pushdown Automata with Translucent Input Letters
    Martin Kutrib, Andreas Malcher and Matthias Wendlandt
  • [Informal talk] DAG Automata for Recognizing Picture Languages
    Yvo Ad Meeres, František Mráz

16:40 - 17:00 | Business meeting

Tuesday, 22 July

08:30 - 09:00 | Registration

09:00 - 10:10 | Contributed and Informal talks | Chair: František Mráz

  • A Myhill-Nerode type characterization of 2detLIN languages
    Benedek Nagy
  • [Informal talk] Subsequence Matching and Analysis Problems for Automata with Translucent Letters
    Szilárd Zsolt Fazekas, Béla Klein, Tore Koß, Florin Manea, Robert Mercaş, Timo Specht
  • [Informal talk] Parameterizations of Logarithmic-Space Reductions, Stack-State Complexity of Nonuniform Families of Pushdown Automata, and a Road to the LOGCFL⊆LOGDCFL/poly Question
    Tomoyuki Yamakami

10:20 - 11:00 | Coffee break

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 | Closing followed by DCFS (22-24 July)