default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th WORDS 2013: Turku, Finland
- Juhani Karhumäki, Arto Lepistö, Luca Q. Zamboni:
Combinatorics on Words - 9th International Conference, WORDS 2013, Turku, Finland, September 16-20. Proceedings. Lecture Notes in Computer Science 8079, Springer 2013, ISBN 978-3-642-40578-5
Invited
- Julien Cassaigne:
Which Arnoux-Rauzy Words Are 2-Balanced? 1-2 - Michel Dekking:
Dynamical Equivalence of Morphisms. 3 - Vesa Halava:
Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem. 4-13 - Gilbert Levitt:
Subword Complexity in Free Groups. 14 - Narad Rampersad:
Non-constructive Methods for Avoiding Repetitions in Words. 15-17 - Giusi Castiglione, Marinella Sciortino:
Words, Trees and Automata Minimization. 18-33
Contributions
- Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
Auto-similarity in Rational Base Number Systems. 34-45 - L'ubomíra Balková, Michelangelo Bucci, Alessandro De Luca
, Svetlana Puzynina:
Infinite Words with Well Distributed Occurrences. 46-57 - Valérie Berthé, Jérémie Bourdon, Timo Jolivet, Anne Siegel:
Generating Discrete Planes with Substitutions. 58-70 - Valérie Berthé, Sébastien Labbé:
Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm. 71-82 - Christian Choffrut, Robert Mercas:
The Lexicographic Cross-Section of the Plactic Monoid Is Regular. 83-94 - James D. Currie, Narad Rampersad, Kalle Saari:
Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). 95-106 - Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
Periodicity Forcing Words. 107-118 - Vincent Delecroix, Tomás Hejda, Wolfgang Steiner:
Balancedness of Arnoux-Rauzy and Brun Words. 119-131 - Alessandro De Luca, Gabriele Fici:
Open and Closed Prefixes of Sturmian Words. 132-142 - Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina:
Finitely Generated Ideal Languages and Synchronizing Automata. 143-153 - Tero Harju:
A Note on Square-Free Shuffles of Words. 154-160 - Mari Huova, Aleksi Saarela:
Strongly k-Abelian Repetitions. 161-168 - Tomi Kärki:
Similarity Relations and Repetition-Freeness. 169-180 - Florence Levé, Gwénaël Richomme:
On Quasiperiodic Morphisms. 181-192 - Zuzana Masáková, Edita Pelantová:
Enumerating Abelian Returns to Prefixes of Sturmian Words. 193-204 - Rogério Reis, Emanuele Rodaro:
Regular Ideal Languages and Synchronizing Automata. 205-216 - Michel Rigo, Pavel Salimov:
Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words. 217-228 - Aleksi Saarela:
Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants. 229-237 - Tim Smith:
On Infinite Words Determined by L Systems. 238-249 - Shuo Tan, Jeffrey O. Shallit:
Sets Represented as the Length-n Factors of a Word. 250-261
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
