The program of CIAA 2019 can be downloaded here.
Photos from the welcome reception of CIAA 2019 are available here.

Program

Monday, July 22

08:30 - 09:25 Registration
09:25 - 09:30 Opening
Session 1 chair: Viliam Geffert
09:30 - 10:30 Alternation in Two-Way Finite Automata (invited talk) Christos Kapoutsis
10:30 - 11:00 Coffee break
Session 2 chair: Andreas Malcher
11:00 - 11:30 Two-dimensional Pattern Matching against Basic Picture Languages František Mráz, Daniel Průša, and Michael Wehar
11:30 - 12:00 Decision Problems for Restricted Variants of Two-Dimensional Automata Taylor J. Smith and Kai Salomaa
12:00 - 14:00 Lunch
Session 3 chair: Christos Kapoutsis
14:00 - 15:00 Graph-Walking Automata: From Whence They Come and Whither They Are Bound (invited talk) Alexander Okhotin
15:00 - 15:30 Coffee break
Session 4 chair: György Vaszil
15:30 - 16:00 A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata Yo-Sub Han, Hwee Kim, Yusei Masuda, and Shinnosuke Seki
16:00 - 16:30 Input-Driven Multi-Counter Automata Martin Kutrib, Andreas Malcher, and Matthias Wendlandt
16:30 - 17:00 Semi-Linear Lattices and Right One-Way Jumping Finite Automata Simon Beier and Markus Holzer
18:00 Welcome reception

Tuesday, July 23

Session 5 chair: Martin Kutrib
09:30 - 10:30 Deciding Equivalence of Tree Transducers by Means of Precise Abstract Interpretation (invited talk) Helmut Seidl
10:30 - 11:00 Coffee break
Session 6 chair: Shinnosuke Seki
11:00 - 11:30 Composition Closure of Linear Weighted Extended Top-Down Tree Transducers Zoltán Fülöp and Andreas Maletti
11:30 - 12:00 Streaming Ranked-Tree-to-String Transducers Yuta Takahashi, Kazuyuki Asada, and Keisuke Nakano
12:00 - 14:00 Lunch
Session 7 chair: Andreas Maletti
14:00 - 14:30 A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs Akio Fujiyoshi and Daniel Průša
14:30 - 15:00 Z-Automata for Compact and Direct Representation of Unranked Tree Languages Johanna Björklund, Frank Drewes, and Giorgio Satta
15:00 - 15:30 Coffee break
Session 8 chair: Markus Holzer
15:30 - 16:00 Partial Derivatives of Regular Expressions over Alphabet-invariant and User-defined Labels Stavros Konstantinidis, Nelma Moreira, João Pires, and Rogério Reis
16:00 - 16:30 Enumerated Automata Implementation of String Dictionaries Robert Bakarić, Damir Korenčić, and Strahil Ristov
17:00 - 18:30 Guided tour in the city center

Wednesday, July 24

Session 9 chair: Juraj Šebej
09:30 - 10:30 Large Scale Sorting in Distributed Data Processing Systems (invited talk) Marián Dvorský
10:30 - 11:00 Coffee break
Session 10 (tool session) chair: Rogério Reis
11:00 - 11:30 A Benchmark Production Tool for Regular Expressions Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi, and Angelo Morzenti
11:30 - 12:00 other tools
12:00 - 14:00 Lunch break
14:00 - 21:00 Conference trip with conference dinner

Thursday, July 25

Session 11 chair: Hsu-Chun Yen
09:30 - 10:30 Static Garbage Collection (invited talk) Sebastian Maneth
10:30 - 11:00 Coffee break
Session 12 chair: Stavros Konstantinidis
11:00 - 11:30 New Approaches for Context Sensitive Flash Codes Gilad Baruch, Shmuel T. Klein, and Dana Shapira
11:30 - 12:00 New Algorithms for Manipulating Sequence BDDs Shuhei Denzumi
12:00 - 12:30 Business meeting
12:30 - 14:00 Lunch break
Session 13 chair: Galina Jirásková
14:00 - 14:30 Dolev-Yao Theory with Associative Blindpair Operators A Baskar, R Ramanujam, and S P Suresh
14:30 - 15:00 Descriptional Complexity of Power and Positive Closure on Convex Languages Michal Hospodár
15:00 - 15:30 Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations Stavros Konstantinidis, Mitja Mastnak, and Juraj Šebej