| Description |
1 online resource (x, 263 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 8079 |
|
Lecture notes in computer science ; 8079.
|
| Contents |
Invited. Which Arnoux-Rauzy Words Are 2-Balanced? / Julien Cassaigne -- Dynamical Equivalence of Morphisms / Michel Dekking -- Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem / Vesa Halava -- Subword Complexity in Free Groups / Gilbert Levitt -- Non-constructive Methods for Avoiding Repetitions in Words / Narad Rampersad -- Words, Trees and Automata Minimization / Giusi Castiglione and Marinella Sciortino -- Contributions. Auto-similarity in Rational Base Number Systems / Shigeki Akiyama, Victor Marsault and Jacques Sakarovitch -- Infinite Words with Well Distributed Occurrences / Ĺubomíra Balková ... et al. -- Generating Discrete Planes with Substitutions / Valérie Berthé ... et al. -- Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm / Valérie Berthé and Sebastien Labbé -- The Lexicographic Cross-Section of the Plactic Monoid Is Regular / Christian Choffrut and Robert Mercaş -- Suffix Conjugates for a Class of Morphic Subshifts / James D. Currie, Narad Rampersad and Kalle Saari -- Periodicity Forcing Words / Joel D. Day, Daniel Reidenbach and Johannes C. Schneider -- Balancedness of Arnoux-Rauzy and Brun Words / Vincent Delecroix, Tomáš Hejda and Wolfgang Steiner -- Open and Closed Prefixes of Sturmian Words / Alessandro De Luca and Gabriele Fici -- Finitely Generated Ideal Languages and Synchronizing Automata / Vladimir V. Gusev, Marina I. Maslennikova and Elena V. Pribavkina -- A Note on Square-Free Shuffles of Words / Tero Harju -- Strongly k-Abelian Repetitions / Mari Huova and Aleksi Saarela -- Similarity Relations and Repetition-Freeness / Tomi Kärki -- On Quasiperiodic Morphisms / Florence Levé and Gwénaël Richomme -- Enumerating Abelian Returns to Prefixes of Sturmian Words / Zuzana Masáková and Edita Pelantová -- Regular Ideal Languages and Synchronizing Automata / Rogério Reis and Emanuele Rodaro -- Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words / Michel Rigo and Pavel Salimov -- Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants / Aleksi Saarela -- On Infinite Words Determined by L Systems / Tim Smith -- Sets Represented as the Length-n Factors of a Word / Shuo Tan and Jeffrey Shallit |
| Summary |
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 |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Online resource; title from PDF title page (SpringerLink, viewed September 25, 2013) |
| Subject |
Combinatorial analysis -- Congresses
|
|
Word problems (Mathematics) -- Congresses
|
|
Mathematics.
|
|
Software
|
|
Mathematics
|
|
software.
|
|
Mathematics
|
|
Combinatorial analysis
|
|
Word problems (Mathematics)
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Karhumäki, Juhani, editor
|
|
Lepistö, Arto, editor
|
|
Zamboni, Luca, 1962- editor.
|
| ISBN |
9783642405792 |
|
3642405797 |
|
