Combinatorics on words : 9th international conference, WORDS 2013, Turku, Finland, September 16-20, 2013 : proceedings

This book constitutes the refereed proceedings of the 9th International Conference on Combinatorics on Words, WORDS 2013, held in Turku, Finland, in September 2013 under the auspices of the EATCS. The 20 revised full papers presented were carefully reviewed and selected from 43 initial submissions. The central topic of the conference is combinatorics on words (i.e. the study of finite and infinite sequence of symbols) from varying points of view, including their combinatorial, algebraic and algorithmic aspects, as well as their applications. Front Matter....Pages - Which Arnoux-Rauzy Words Are 2-Balanced?....Pages 1-2 Dynamical Equivalence of Morphisms....Pages 3-3 Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem....Pages 4-13 Subword Complexity in Free Groups....Pages 14-14 Non-constructive Methods for Avoiding Repetitions in Words....Pages 15-17 Words, Trees and Automata Minimization....Pages 18-33 Auto-similarity in Rational Base Number Systems....Pages 34-45 Infinite Words with Well Distributed Occurrences....Pages 46-57 Generating Discrete Planes with Substitutions....Pages 58-70 Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm....Pages 71-82 The Lexicographic Cross-Section of the Plactic Monoid Is Regular....Pages 83-94 Suffix Conjugates for a Class of Morphic Subshifts....Pages 95-106 Periodicity Forcing Words....Pages 107-118 Balancedness of Arnoux-Rauzy and Brun Words....Pages 119-131 Open and Closed Prefixes of Sturmian Words....Pages 132-142 Finitely Generated Ideal Languages and Synchronizing Automata....Pages 143-153 A Note on Square-Free Shuffles of Words....Pages 154-160 Strongly k -Abelian Repetitions....Pages 161-168 Similarity Relations and Repetition-Freeness....Pages 169-180 On Quasiperiodic Morphisms....Pages 181-192 Enumerating Abelian Returns to Prefixes of Sturmian Words....Pages 193-204 Regular Ideal Languages and Synchronizing Automata....Pages 205-216 Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words....Pages 217-228 Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants....Pages 229-237 On Infinite Words Determined by L Systems....Pages 238-249 Sets Represented as the Length- n Factors of a Word....Pages 250-261 Back Matter....Pages -