The presentations of all authors are available now.

**Monday, July 16**
8:00-8:45	Registration
8:45-9:00	Opening
9:00-10:00	Chair: Jan Holub Gheorghe Păun (Romanian Academy, Romania) Invited Lecture: Spiking Neural P Systems Used as Acceptors and Transducers, demo–SpikeTrains.exe
10:00-10:30	Coffee break
10:30-12:00	Chair: Pierluigi San Pietro Synchronizing Automata Preserving a Chain of Partial Orders Mikhail V. Volkov Reducing Acyclic Cover Transducers Jean-Marc Champarnaud, Franck Guingne, and Jacques Farré On-the-fly Stuttering in the Construction of Deterministic ω-Automata Joachim Klein and Christel Baier
12:00-13:30	Lunch
13:30-15:00	Chair: Jorma Tarhio Average Value and Variance of Pattern Statistics in Rational Models Massimiliano Goldwurm and Roberto Radicioni Weighted Automata and Weighted Logics with Discounting Manfred Droste and George Rahonis Regulated Nondeterminism in Pushdown Automata Martin Kutrib, Andreas Malcher, and Larissa Werlein
15:00-15:30	Coffee break
15:30-17:00	Chair: Bruce W. Watson Deterministic Caterpillar Expressions Kai Salomaa, Sheng Yu, and Jinfeng Zan Backward and Forward Bisimulation Minimisation of Tree Automata Johanna Högberg, Andreas Maletti, and Jonathan May An Implementation of Deterministic Tree Automata Minimization Rafael C. Carrasco, Jan Daciuk, and Mikel L. Forcada
17:00-18:00	Coffee break + Poster session
18:00-19:30	Welcome drink

**Tuesday, July 17**
9:00-10:00	Chair: Oscar H. Ibarra Moshe Y. Vardi (Rice University, USA) Invited Lecture: Linear-Time Model Checking: Automata Theory in Practice
10:00-10:30	Coffee break
10:30-12:00	Chair: Gheorghe Paun Accelerating Boyer Moore Searches on Binary Texts Shmuel Tomi Klein and Miri Kopel Ben-Nissan On the Suffix Automaton with Mismatches Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, and Filippo Mignosi On String Matching in Chunked Texts Hannu Peltola and Jorma Tarhio
12:00-13:30	Lunch
13:30-15:00	Chair: Bořivoj Melichar Michael Riley (Google, Inc., USA) Invited Lecture: OpenFst: a General and Efficient Weighted Finite-State Transducer Library Factor Automata of Automata and Applications Mehryar Mohri, Pedro Moreno, and Eugene Weinstein Subset Seed Automaton Gregory Kucherov, Laurent Noé, and Mikhail Roytberg
15:00-15:30	Coffee break
15:30-22:00	Social event Conference dinner

**Wednesday, July 18**
9:00-10:00	Chair: Sheng Yu Bruce W. Watson (University of Pretoria, South Africa; Sagantec, USA) Invited Lecture: Automata Applications in Chip-design Software
10:00-10:30	Coffee break
10:30-12:00	Chair: Moshe Vardi A Measure for the Degree of Nondeterminism of Context-free Languages František Mráz, Martin Plátek, and Friedrich Otto Efficient Computation of Throughput Values of Context-Free Languages Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, and Wojciech Rytter Analyzing Ambiguity of Context-Free Grammars Claus Brabrand, Robert Giegerich, and Anders Møller
12:00-13:30	Lunch
13:30-15:00	Chair: Jan Daciuk Efficient Enumeration of Regular Languages Margareta Ackerman and Jeffrey Shallit Multi-Grain Relations François Barthélemy Memory Reduction for Strategies in Infinite Games Michael Holtmann and Christof Löding
15:00-15:30	Coffee break
15:30-17:00	Chair: John Brzozowski Syntax-Directed Translations and Quasi-Alphabetic Tree Bimorphisms Magnus Steinby and Cătălin Ionuţ Tîrnăucă Finite State Automata Representing Two-Dimensional Subshifts Nataša Jonoska and Joni B. Pirnot Tiling Automaton: a Computational Model for Recognizable Two-dimensional Languages Marcella Anselmo, Dora Giammarresi, and Maria Madonia
17:00-18:00	Best paper award + Future of CIAA discussion + Closing