Contributions to appear in the LNCS volume:
- T. Harju: A note on Square-Free Shuffles of Words
- S. Tan and J. Shallit: Sets Represented as the Length-n Factors of a Word
- F. Leve and G. Richomme: On Quasiperiodic Morphisms
- M. Rigo and P. Salimov: Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words
- J. D. Day, D. Reidenbach and J. C. Schneider: Periodicity Forcing Words
- T. Smith: On Infinite Words Determined by L Systems
- V. Berthé J. Bourdon, T. Jolivet and A. Siegel: Generating discrete planes with substitutions
- R. Reis and E. Rodaro: Regular Ideal Languages and Synchronizing Automata
- C. Choffrut and R. Mercas: The lexicographic cross-section of the plactic monoid is regular
- Z. Masakova and E. Pelantová: Enumerating Abelian Returns to Prefixes of Sturmian Words
- A. Saarela: Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants
- S. Akiyama, V. Marsault and J. Sakarovitch: Auto-similarity in rational base number systems
- A. De Luca and G. Fici: Open and Closed Prefixes of Sturmian Words
- V. Berthé and S. Labbé: Convergence and Factor Complexity of the Arnoux-Rauzy-Poincaré Algorithm
- M. Huova and A. Saarela: Strongly k-abelian repetitions
- V. Gusev, M. Maslennikova and E. Pribavkina: Finitely generated ideal languages and synchronizing automata
- J. D. Currie, N. Rampersad and K. Saari: Suffix conjugates for a class of morphic subshifts
- L. Balkova, M. Bucci, A. De Luca and S. Puzynina: Infinite Words with Well Distributed Occurences
- V. Delacroix, T. Hejda and W. Steiner: Balancedness of Arnoux-Rauzy and Brun words
- T. Kärki: Similarity Relations and Repetition-freenes
Other contributions to appear in the local proceedings:
- J. Peltomäki: Introducing Privileged Words: Privileged Complexity of Sturmian Words
- S. Ferenczi: The self-dual induction for interval exchange transformations
- D. Dombek: Generating (±β)-integers by Conjugated Morphisms
- N. Poliakov: On algorithmic decidability of the square-free word problem relative to a system of two defining relations
- A. Valyuzhenich: On factor complexity of infinite permutations
- W. Forys: When images of substitutions shifts are traces shifts
- Š. Starosta: Palindromic richness for languages invariant under more symmetries: results, examples and open questions
- K. Klouda and Š. Starosta: An Algorithm Enumerating All Infinite Repetitions in a D0L System
- L. Hegedüs and B. Nagy; Periodicity of Circular Words
- W. Moczurad: Defect Property in Z2
- F. Burderi: Some combinatorial properties of maximal sets