List of Accepted Papers

• Daniel Goc, Luke Schaeffer and Jeffrey Shallit.
  Subword Complexity and k-Synchronization
• Francine Blanchet-Sadri and Brent Woodhouse.
  Strict Bounds for Pattern Avoidance
• Artur Jeż and Alexander Okhotin.
  Unambiguous conjunctive grammars over a one-letter alphabet
• Zoltán Fülöp and Andreas Maletti.
  Composition Closure of Epsilon-free Linear Extended Top-down Tree Transducers
• Victor Marsault and Jacques Sakarovitch.
  Ultimate periodicity of b-recognisable sets : a quasilinear procedure
• Ping Lu, Feifei Peng and Haiming Chen.
  Deciding Determinism of Unary Languages Is coNP-Complete
• Aldo de Luca, Elena Pribavkina and Luca Q. Zamboni.
  A Coloring Problem for Sturmian and Episturmian Words
• Manfred Droste and Heiko Vogler.
  The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
• Francine Blanchet-Sadri and Nathan Fox.
  On the Asymptotic Abelian Complexity of Morphic Words
• Federica Panella, Matteo Pradella, Violetta Lonati and Dino Mandrioli.
  Operator Precedence omega-languages
• Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi and Elise Prieur-Gaston.
  Abelian Repetitions in Sturmian Words
• Oscar Ibarra and Bala Ravikumar.
  Some Decision Questions Concerning the Time Complexity of Language Acceptors
• Seyyed Hamoon Mousavi Haji and Jeffrey Shallit.
  Repetition Avoidance in Circular Factors
• Alberto Bertoni, Christian Choffrut and Flavio Dalessandro.
  Quantum finite automata and linear context-free languages: a decidable problem
• Mohamed Faouzi Atig, K. Narayan Kumar and Prakash Saivasan.
  Adjacent Ordered Multi-Pushdown Systems
• Daniel Prusa, Frantisek Mraz and Friedrich Otto.
  New Results on Deterministic Sgraffito Automata
• Zoltan Esik and Szabolcs Ivan.
  Operational characterization of scattered MCFLs
• Sylvain Lombardy and Vincent Carnino.
  Factorizations and Universal Automaton of Omega Languages
• Kalle Saari, James Currie and Narad Rampersad.
  Extremal words in the shift orbit closure of a morphic sequence
• Ugur Kucuk, A. C. Cem Say and Abuzer Yakaryilmaz.
  Finite automata with advice tapes
• Jürgen Dassow, Florin Manea, Robert Mercas and Mike Müller.
  Inner Palindromic Closure
• Leonid Libkin, Tony Tan and Domagoj Vrgoc.
  Regular Expressions with Binding over Data Words for Querying Graph Databases
• Robert Mercas and Aleksi Saarela.
  3-Abelian Cubes Are Avoidable on Binary Alphabets
• Martin Kutrib, Andreas Malcher and Matthias Wendlandt.
  One-Way Multi-Head Finite Automata with Pebbles But No States
• Damien Regnault.
  Proof a phase transition in probabilistic cellular autoamata
• Marcella Anselmo, Dora Giammarresi and Maria Madonia.
  Two dimensional prefix codes of pictures
• Narad Rampersad, Michel Rigo and Pavel Salimov.
  On the Number of Abelian Bordered Words
• Benedikt Bollig, Peter Habermehl, Martin Leucker and Benjamin Monmege.
  A Fresh Approach to Learning Register Automata
• Martin Berglund, Frank Drewes, Henrik Björklund, Brink van der Merwe and Bruce Watson.
  Cuts in Regular Expressions
• Ondrej Klima and Libor Polak.
  Alternative Automata Characterization of Piecewise Testable Languages
• Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone and Marinella Sciortino.
  Suffixes, Conjugates and Lyndon words
• Sven De Felice and Cyril Nicaud.
  Brzozowski Algorithm is Generically Super-Polynomial for Deterministic Automata
• Arseny Shur.
  Languages with A Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth
• Joel D. Day, Daniel Reidenbach and Johannes C. Schneider.
  On the Dual Post Correspondence Problem