Abstract is missing.
- Which Arnoux-Rauzy Words Are 2-Balanced?Julien Cassaigne. 1-2 [doi]
- Dynamical Equivalence of MorphismsMichel Dekking. 3 [doi]
- Deterministic Semi-Thue Systems and Variants of Post Correspondence ProblemVesa Halava. 4-13 [doi]
- Subword Complexity in Free GroupsGilbert Levitt. 14 [doi]
- Non-constructive Methods for Avoiding Repetitions in WordsNarad Rampersad. 15-17 [doi]
- Words, Trees and Automata MinimizationGiusi Castiglione, Marinella Sciortino. 18-33 [doi]
- Auto-similarity in Rational Base Number SystemsShigeki Akiyama, Victor Marsault, Jacques Sakarovitch. 34-45 [doi]
- Infinite Words with Well Distributed OccurrencesLubomíra Balková, Michelangelo Bucci, Alessandro De Luca 0002, Svetlana Puzynina. 46-57 [doi]
- Generating Discrete Planes with SubstitutionsValérie Berthé, Jérémie Bourdon, Timo Jolivet, Anne Siegel. 58-70 [doi]
- Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré AlgorithmValérie Berthé, Sébastien Labbé. 71-82 [doi]
- The Lexicographic Cross-Section of the Plactic Monoid Is RegularChristian Choffrut, Robert Mercas. 83-94 [doi]
- Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract)James D. Currie, Narad Rampersad, Kalle Saari. 95-106 [doi]
- Periodicity Forcing WordsJoel D. Day, Daniel Reidenbach, Johannes C. Schneider. 107-118 [doi]
- Balancedness of Arnoux-Rauzy and Brun WordsVincent Delecroix, Tomás Hejda, Wolfgang Steiner. 119-131 [doi]
- Open and Closed Prefixes of Sturmian WordsAlessandro De Luca 0002, Gabriele Fici. 132-142 [doi]
- Finitely Generated Ideal Languages and Synchronizing AutomataVladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina. 143-153 [doi]
- A Note on Square-Free Shuffles of WordsTero Harju. 154-160 [doi]
- Strongly k-Abelian RepetitionsMari Huova, Aleksi Saarela. 161-168 [doi]
- Similarity Relations and Repetition-FreenessTomi Kärki. 169-180 [doi]
- On Quasiperiodic MorphismsFlorence Levé, Gwénaël Richomme. 181-192 [doi]
- Enumerating Abelian Returns to Prefixes of Sturmian WordsZuzana Masáková, Edita Pelantová. 193-204 [doi]
- Regular Ideal Languages and Synchronizing AutomataRogério Reis, Emanuele Rodaro. 205-216 [doi]
- Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite WordsMichel Rigo, Pavel Salimov. 217-228 [doi]
- Weakly Unambiguous Morphisms with Respect to Sets of Patterns with ConstantsAleksi Saarela. 229-237 [doi]
- On Infinite Words Determined by L SystemsTim Smith. 238-249 [doi]
- Sets Represented as the Length-n Factors of a WordShuo Tan, Jeffrey Shallit. 250-261 [doi]