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