Accepted Papers

(35 papers, sorted by first author, title linked to abstract)

1. Marie-Pierre Beal and Dominique Perrin
   A quadratic upper bound on the size of a synchronizing word in one-cluster automata
    
2. Christoph Behle, Andreas Krebs and Stephanie Reifferscheid
   Regular Languages definable by Majority Quantifiers with two Variables
    
3. Alberto Bertoni, Christian Choffrut and Roberto Radicioni
   The Inclusion Problem of Context-free Languages: Some Tractable Cases.
    
4. Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter and Narad Rampersad
   On the Complexity of Deciding Avoidability of sets of Partial Words
    
5. Janusz Brzozowski, Elyot Grant and Jeffrey Shallit
   Closures in Formal Languages and Kuratowski's Theorem
    
6. Michelangelo Bucci, Aldo de Luca and Alessandro De Luca
   Rich and Periodic-like Words
    
7. Simone Campanoni and Stefano Crespi Reghizzi
   Traces of control-flow graphs
    
8. Olivier Carton
   Left and right synchronous relations
    
9. Elena Czeizler, Eugen Czeizler, Lila Kari and Shinnosuke Seki
   An Extension of the Lyndon Schutzenberger Result to Pseudoperiodic Words
    
10. Bruno Durand and Victor Poupet
    Asymptotic Cellular Complexity
     
11. Omer Egecioglu
    Strongly Regular Grammars and Regular Approximation of Context-Free Languages
     
12. Szilard Zsolt Fazekas
    Powers of regular languages
     
13. Dominik D. Freydenberger and Daniel Reidenbach
    Existence and Nonexistence of Descriptive Patterns
     
14. Pierluigi Frisco and Oscar Ibarra
    On Stateless Multihead Finite Automata and Multihead Pushdown Automata
     
15. Christiane Frougny and Anna Chiara Lai
    On negative bases
     
16. Amy Glen, Bjarni V. Halldórsson and Sergey Kitaev
    Crucial words for abelian powers
     
17. Hermann Gruber and Markus Holzer
    Tight Bounds on the Descriptional Complexity of Regular Expressions
     
18. Emmanuel Jeandel and Guillaume Theyssier
    Subshifts, Languages and Logic
     
19. Galina Jiraskova
    Magic Numbers and Ternary Alphabet
     
20. Makoto Kanazawa
    The Pumping Lemma for Well-Nested Multiple Context-Free Languages
     
21. Daniel Kirsten
    The Support of a Recognizable Series Over a Zero-sum Free, Commutative Semiring is Recognizable
     
22. Vassilis Kountouriotis, Christos Nomikos and Panos Rondogiannis
    A Game-Theoretic Characterization of Boolean Grammars
     
23. Markku Laine and Wojciech Plandowski
    Word Equations with One Unknown
     
24. Tommi Lehtinen and Alexander Okhotin
    On equations over sets of numbers and their limitations
     
25. Florin Manea, Victor Mitrana and Jose Sempere
    Some Remarks on Superposition Based on Watson-Crick-like Complementarity
     
26. Ingmar Meinecke
    A weighted μ-calculus on words
     
27. Fabio Mogavero and Aniello Murano
    Branching-Time Temporal Logics with Minimal Model Quantifiers
     
28. Holger Petersen
    Simulations by Time-Bounded Counter Machines
     
29. Karin Quaas
    Weighted Timed MSO Logics
     
30. Antonio Restivo and Giovanna Rosone
    Balanced words having simple Burrows-Wheeler Transform
     
31. Aleksi Saarela
    On Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
     
32. Oleg Kudinov and Victor Selivanov
    Definability in the Infix Order on Words
     
33. Arseny Shur
    Two-sided bounds for the growth rates of power-free languages
     
34. Rodrigo de Souza
    On the decidability of the equivalence for a certain class of transducers
     
35. Georg Zetzsche
    Erasing in Petri Net Languages and Matrix Grammars