ACCEPTED PAPERS:

1. A Taxonomy of Deterministic Forgetting Automata, by Jens Glöckler. (final version received)
2. Algorithmically Independent Sequences, by Cristian S. Calude and Marius Zimand. (final version received)
3. An Analysis and a Reproof of Hmelevskii's Theorem (Extended Abstract), by juhani karhumaki and Aleksi Saarela. (final version received)
4. Bad News on Decision Problems for Patterns, by Dominik Freydenberger and Daniel Reidenbach. (final version received)
5. Balance Properties and Distribution of Squares in Circular Words, by Roberto Mantaci, Sabrina Mantaci and Antonio Restivo. (final version received)
6. Bounds on powers in strings, by Maxime Crochemore, Szilard Fazekas, Costas Iliopoulos and Inuka Jayasekera. (final version received)
7. Complexity of Topological Properties of Regular Omega-Languages, by Victor Selivanov and Klaus W. Wagner. (final version received)
8. Construction of tree automata from regular expressions, by Ingmar Meinecke and Dietrich Kuske. (final version received)
9. Decidable properties of 2D cellular automata, by Alberto Dennunzio and Enrico Formenti. (final version received)
10. Derivation Tree Analysis for Accelerated Fixed-Point Calculation, Michael Luttenberger, Javier Esparza and Stefan Kiefer. (final version received)
11. Duplication in DNA sequences, by Masami Ito, Lila Kari, Zachary Kincaid and Shinnosuke Seki. (final version received)

12. Emptiness of multi-pushdown automata is 2ETIME-complete, by Mohamed Faouzi Atig, Benedikt Bollig and Peter Habermehl. (final version received)
13. Extended Multi Bottom-Up Tree Transducers, Joost Engelfriet, Eric Lilin and Andreas Maletti. (final version received)
14. Finding the growth rate of a regular or context-free language in polynomial time, by Pawel Gawrychowski, Dalia Krieger, Narad Rampersad and Jeffrey Shallit. (final version received)

15. Fixed point and aperiodic tilings, by Andrei Romashchenko, Bruno Durand and Alexander Shen. (final version received)
16. General Algorithms for Testing the Ambiguity of Finite Automata, by Cyril Allauzen, Mehryar Mohri and Ashish Rastogi. (final version received)
17. Hierarchies of Piecewise Testable Languages, by Ondrej Klima and Libor Polak. (final version received)
18. More Concise Representation of Regular Languages by, Automata and Regular Expressions, Viliam Geffert, Carlo Mereghetti and Beatrice Palano. (final version received)
19. On a Generalization of Episturmian Morphisms, by Michelangelo Bucci, Aldo de Luca and Alessandro De Luca. (final version received)
20. On the Computational Capacity of Parallel Communicating Finite Automata, by Henning Bordihn, Martin Kutrib and Andreas Malcher. (final version received)
21. On the decidability of equivalence for $k$-valued transducers, Rodrigo de Souza. (final version received)
22. On the non-deterministic communication complexity of regular languages, by Anil Ada. (final version received)
23. On the Relation between Periodicity and Unbordered Factors of Finite Words, by Stepan Holub and Dirk Nowotka. (final version received)
24. On the Size Complexity of Rotating and Sweeping Automata, by Christos Kapoutsis, Richard Kralovic and Tobias Moemke. (final version received)
25. On the State Complexity of Complements, Stars, and Reversals of Regular Languages, by Galina Jiraskova. (final version received)
26. On the state complexity of operations on two-way finite automata, by Galina Jiraskova and Alexander Okhotin. (final version received)
27. (Pomsets) MSO Logic for Unambiguous Shared-Memory Systems, by Remi Morin. (final version received, The title was changed.)
28. (Primitive) Large Simple Binary Equality Words, by Jana Hadravova and Stepan Holub. (final version received, The title was changed.)
29. Provably Shorter Regular Expressions from Deterministic Finite Automata, by Hermann Gruber and Markus Holzer. (final version received)

30. Relationally Periodic Sequences and Subword Complexity, by Julien Cassaigne, Tomi Kärki and Luca Q. Zamboni. (final version received)
31. Some New Modes of Competence-Based Derivations, by Erzsébet Csuhaj-Varjú, Jürgen dassow and György Vaszil. (final version received)
32. The average state complexity of the star of a finite set of words is linear, by Frédérique Bassino, Laura Giambruno and Cyril Nicaud. (final version received)
33. The synchronization problem for strongly transitive automata, by flavio dalessandro and Arturo Carpi. (final version received)
34. Tree Automata with Global Constraints, by Emmanuel Filiot, Jean-Marc Talbot and Sophie Tison. (final version received)
35. Universal Recursively Enumerable Sets of Strings, by Cristian S. Calude, Andre Nies, Ludwig Staiger and Frank Stephan. (final and its revised versions received)

36. When Is Reachability Intrinsically Decidable?, by Barbara Csima and Bakhadyr Khoussainov. (final version received)