The program of DCFS 2019 can be downloaded here.
Photos from DCFS 2019 are available here.

Program

Tuesday, July 16

17:00 - 20:00 Welcome reception in Hotel TeleDom

Wednesday, July 17

07:30 - 08:00 Registration
Session 1 chair: Jarkko Kari
08:00 - 09:00 Limited Automata: Properties, Complexity and Variants (invited talk) Giovanni Pighizzini
09:00 - 09:30 Coffee break
Session 2 chair: Martin Kutrib
09:30 - 10:00 Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity Yo-Sub Han, Sang-Ki Ko, and Kai Salomaa
10:00 - 10:30 Pushdown Automata and Constant Height: Decidability and Bounds Giovanni Pighizzini and Luca Prigioniero
10:30 - 11:00 On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances Petra Wolf
11:30 - 13:30 Lunch
Session 3 chair: Henning Fernau
13:30 - 14:30 A General Framework for Sequential Grammars with Control Mechanisms (invited talk) Rudolf Freund
14:30 - 15:00 Coffee break
Session 4 chair: Rudolf Freund
15:00 - 15:30 Descriptional Complexity of Matrix Simple Semi-Conditional Grammars Henning Fernau, Lakshmanan Kuppusamy, and Indhumathi Raman
15:30 - 16:00 Computability on Quasi-Polish Spaces Mathieu Hoyrup, Cristóbal Rojas, Victor Selivanov, and Donald Stull
16:00 - 16:30 On Classes of Regular Languages Related to Monotone WQOs Mizuhito Ogawa and Victor Selivanov
17:00 - 18:30 Guided tour in the city center

Thursday, July 18

Session 5 chair: Alexander Okhotin
08:00 - 09:00 Low-Complexity Tilings of the Plane (invited talk) Jarkko Kari
09:00 - 09:30 Coffee break
Session 6 chair: Nelma Moreira
09:30 - 10:00 How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? Tomoyuki Yamakami
10:00 - 10:30 Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract) Simon Beier and Markus Holzer
10:30 - 11:00 Regulated Tree Automata Henning Fernau and Martin Vu
11:30 - 18:00 Conference trip with lunch
19:00 Conference dinner

Friday, July 19

Session 7 chair: Juraj Šebej
08:00 - 09:00 Union-Freeness, Deterministic Union-Freeness and Union-Complexity (invited talk) Benedek Nagy
09:00 - 09:30 Coffee break
Session 8 chair: Giovanni Pighizzini
09:30 - 10:00 Descriptional Complexity of Iterated Uniform Finite State Transducers Martin Kutrib, Andreas Malcher, Carlo Mereghetti, and Beatrice Palano
10:00 - 10:30 The Syntactic Complexity of Semi-Flower Languages Kitti Gelle and Szabolcs Iván
10:30 - 11:00 Generalized de Bruijn Words and the State Complexity of Conjugate Sets Daniel Gabric, Štěpán Holub, and Jeffrey Shallit
11:00 - 11:30 Business meeting
12:00 - 14:00 Lunch break
Session 9 chair: Michal Hospodár
14:00 - 14:30 State Complexity of Simple Splicing Lila Kari and Timothy Ng
14:30 - 15:00 Nondeterminism Growth and State Complexity Chris Keeler and Kai Salomaa
15:00 - 15:30 State Complexity of GF(2)-Concatenation and GF(2)(2)-Inverse on Unary Languages Alexander Okhotin and Elizaveta Sazhneva
15:30 - 16:00 Coffee break
Session 10 chair: Galina Jirásková
16:00 - 16:30 State Complexity of Single-Word Pattern Matching in Regular Languages Janusz Brzozowski, Sylvie Davies, and Abhishek Madan
16:30 - 17:00 Square, Power, Positive Closure, and Complementation on Star-Free Languages Sylvie Davies and Michal Hospodár
17:00 - 17:30 NFA-to-DFA Trade-Off for Regular Operations Galina Jirásková and Ivana Krajňáková

Weekend, July 20-21

We plan to have a trip to High Tatras on Saturday and a small trip to the surrounding of Košice on Sunday. The prices are not included in the conference fee.