The workshop will be held in Middlesex College.

The reception is on Sunday, 21st of July, 15:00-17:00, in the Grad Club, Middlesex College, ground floor. At this time also registration is possible.

The lecture hall is Room 105 B in Middlesex College.

The registration desk will be open again at 8:00 on Monday near the lecture hall.

Coffee breaks will be at the Grad Club in Middlesex College, ground floor.

Agenda for the DCFS general meeting will be be available at the workshop.

Reception and registration from 15:00 to 17:00 at the Grad Club in Middlesex College. Conference material will be available.

- 8:00: Registration is open at the lecture hall
- 9:00-9:15: Opening of the workshop
- 9:15-10:15, Invited Lecture:
*Cezar Câmpeanu:*Blum Static Complexity and Encoding Spaces - 10:15-10:45: Coffee break
- 10:45-11:15:
*Francisco Mota, Scott Aaronson, Luís Antunes, André Souto:*Sophistication as Randomness Deficiency - 11:15-11:45:
*Janusz Brzozowski, David Liu:*Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star - 11:45-12:15:
*Hae-Sung Eom, Yo-Sub Han, Galina Jirásková:*State Complexity of Basic Operations on Non-Returning Regular Languages - 12:15-14:00: Lunch break
- 14:00-14:30:
*Janusz Brzozowski, Baiyu Li:*Syntactic Complexity of R- and J-Trivial Regular Languages - 14:30-15:00:
*Galina Jirásková, Tomáš Masopust:*On the State Complexity of the Reverse of R- and J-trivial Regular Languages - 15:00-15:30:
*Juraj Šebej:*Reversal on Regular Languages and Descriptional Complexity - 15:30-16:00: Coffee break
- 16:00-18:00 or later, Discussion paper session I (see below)

- 9:00-10:00, Invited Lecture:
*Frank Drewes:*Millstream Systems and Graph Transformation for Complex Linguistic Models - 10:00-10:30: Coffee break
- 10:30-11:00:
*Alexander Okhotin:*Improved Normal Form for Grammars with One-Sided Contexts - 11:00-11:30:
*Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:*State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages - 11:30-12:00:
*Markus Holzer, Sebastian Jakobi:*Nondeterministic Biautomata and Their Descriptional Complexity - 12:00-14:00: Lunch break
- 14:00-14:30:
*Giovanni Pighizzini, Andrea Pisoni:*Limited Automata and Regular Languages - 14:30-15:00:
*Martin Kutrib, Andreas Malcher, Matthias Wendlandt:*Size of Unary One-Way Multi-Head Finite Automata - 15:00-15:30:
*Kristína Čevorová:*Kleene Star on Unary Regular Languages - 15:30-16:00: Coffee break
- 16:00-16:30:
*Holger Petersen:*The Power of Centralized PC Systems of Pushdown Automata - 16:30-17:00:
*Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano:*Queue Automata of Constant Length - 17:00-17:30:
*Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano:*A Direct Construction of Finite State Automata for Pushdown Store Languages - 17:30-19:00 Discussion paper session II (see below)

- 9:00-10:00, Invited Lecture:
*Pierre McKenzie:*Can Chimps Go It Alone? - 10:00-10:30: Coffee break
- 10:30-11:00:
*Hamoon Mousavi, Jeffrey Shallit:*Shortest Repetition-Free Words Accepted by Automata - 11:00-11:30:
*Daniel Goč, Alexandros Palioudakis, Kai Salomaa:*Nondeterministic State Complexity of Proportional Removals - 11:30-12:00:
*Hae-Sung Eom, Yo-Sub Han, Sang-Ki Ko:*State Complexity of Subtree-Free Regular Tree Languages - 12:00-13:00: Lunch break
- Afternoon: Excursion to the Longwoods Road Conservation Area

- 9:00-10:00, Invited Lecture:
*Klaus Sutner:*Invertible Transductions and Interaction - 10:00-10:30: Coffee break
- 10:30-11:00:
*Robert Myers, Henning Urbat:*A Characterisation of NL/poly via Nondeterministic Finite Automata - 11:00-11:30:
*Alexandros Palioudakis, Kai Salomaa, Selim Akl:*Comparisons Between Measures of Nondeterminism on Finite Automata - 11:30-12:00:
*Alexandros Palioudakis, Kai Salomaa, Selim Akl:*Finite Nondeterminism vs. DFAs with Multiple Initial States - 12:00-13:00: DCFS General Meeting
- 13:00: Closing

Two time slots have been set aside for *scheduled* discussion sessions.
The following contributions have been accepted so far.
Spontaneous contributions arising during the workshop will also be welcome.

*Sergey Afonin:*Descriptional Complexity of Finite and Infinite Sets of Regular Languages*Mikhail V. Berlinkov:*Complexity of Approximating the Reset Threshhold of Synchronizing Automata*Dmitry Chistikov:*On Counting with Finite Machines*Lila Kari, Manasi S. Kulkarni:*Operations Generating Pseudo-Powers*Rob Myers, Henning Urbat, Jiří Adámek, Stefan Milius:*On State-Minimal Canonical Residual NFAs*Stephen Watt:*Transition Complexity for Regular Languages: Dealing with Large Alphabets*Joshua Young, Stavros Konstantinidis, Evangelos Milios:*Information Distances and Their Approximations for Measuring Similarity between Scientific Articles

- Monday, 16:00-18:00: Chistikov, Kari et al., Myers et al.
- Tuesday, 17:30-19:00: Watt, Young at al.

Participants may also want to hold non-scheduled discussion sessions. Some rooms will be available for this purpose. Requests should be made at least 2 hours in advance to one of the organizers.