Episturmian words: a survey
RAIRO-Theor. Inf. Appl., 43 3 (2009) 403-442
Published online: 2009-03-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
16073 217 (2026)
https://doi.org/10.1007/978-3-032-05228-5_18
New examples of words for which binomial complexities and subword complexity coincide
Léo VivionTheoretical Computer Science 1070 115792 (2026)
https://doi.org/10.1016/j.tcs.2026.115792
The Reflection Complexity of Sequences Over Finite Alphabets
Jean-Paul Allouche, John M. Campbell, Shuo Li, Jeffrey Shallit and Manon StipulantiTheory of Computing Systems 69 (3) (2025)
https://doi.org/10.1007/s00224-025-10234-x
Applications of stable cellular automata on Sturmian words
Moussa Barro, K. Ernest BOGNINI and Boucaré KientégaMalaya Journal of Matematik 13 (03) 239 (2025)
https://doi.org/10.26637/mjm1303/002
On the rigidity of Arnoux-Rauzy words
V. Berthé and S. PuzyninaAdvances in Applied Mathematics 170 102932 (2025)
https://doi.org/10.1016/j.aam.2025.102932
Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
Jarkko PeltomäkiEuropean Journal of Combinatorics 118 103942 (2024)
https://doi.org/10.1016/j.ejc.2024.103942
Clustering and Arnoux-Rauzy words
Sébastien Ferenczi and Luca Q. ZamboniAdvances in Applied Mathematics 153 102621 (2024)
https://doi.org/10.1016/j.aam.2023.102621
On abelian closures of infinite non-binary words
Juhani Karhumäki, Svetlana Puzynina and Markus A. WhitelandDiscrete Mathematics 347 (9) 114069 (2024)
https://doi.org/10.1016/j.disc.2024.114069
The repetition threshold of episturmian sequences
L’ubomíra Dvořáková and Edita PelantováEuropean Journal of Combinatorics 120 104001 (2024)
https://doi.org/10.1016/j.ejc.2024.104001
963 107 (2024)
https://doi.org/10.1007/978-981-97-2069-9_9
Obstructions to Return Preservation for Episturmian Morphisms
Valérie Berthé and Herman Goulet-OuelletTheory of Computing Systems 68 (6) 1512 (2024)
https://doi.org/10.1007/s00224-024-10190-y
Combinatorics on Words
Mélodie Andrieu and Léo VivionLecture Notes in Computer Science, Combinatorics on Words 13899 3 (2023)
https://doi.org/10.1007/978-3-031-33180-0_1
Properties of a ternary infinite word
James Currie, Pascal Ochem, Narad Rampersad and Jeffrey ShallitRAIRO - Theoretical Informatics and Applications 57 1 (2023)
https://doi.org/10.1051/ita/2022010
Sequences of symmetry groups of infinite words
Sergey Luchinin and Svetlana PuzyninaDiscrete Mathematics 346 (1) 113171 (2023)
https://doi.org/10.1016/j.disc.2022.113171
On square factors and critical factors of k-bonacci words on infinite alphabet
N. Ghareghani and P. SharifaniTheoretical Computer Science 865 34 (2021)
https://doi.org/10.1016/j.tcs.2021.02.027
On the group of a rational maximal bifix code
Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou and Dominique PerrinForum Mathematicum 32 (3) 553 (2020)
https://doi.org/10.1515/forum-2018-0270
On non-repetitive complexity of Arnoux–Rauzy words
Kateřina Medková, Edita Pelantová and Élise VandommeDiscrete Applied Mathematics 285 423 (2020)
https://doi.org/10.1016/j.dam.2020.06.016
Profinite Semigroups and Symbolic Dynamics
Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou and Dominique PerrinLecture Notes in Mathematics, Profinite Semigroups and Symbolic Dynamics 2274 169 (2020)
https://doi.org/10.1007/978-3-030-55215-2_6
Abelian periods of factors of Sturmian words
Jarkko PeltomäkiJournal of Number Theory 214 251 (2020)
https://doi.org/10.1016/j.jnt.2020.04.007
11682 226 (2019)
https://doi.org/10.1007/978-3-030-28796-2_18
11682 251 (2019)
https://doi.org/10.1007/978-3-030-28796-2_20
Fixed points of Sturmian morphisms and their derivated words
Karel Klouda, Kateřina Medková, Edita Pelantová and Štěpán StarostaTheoretical Computer Science 743 23 (2018)
https://doi.org/10.1016/j.tcs.2018.06.037
A History of Folding in Mathematics
Michael FriedmanScience Networks. Historical Studies, A History of Folding in Mathematics 59 355 (2018)
https://doi.org/10.1007/978-3-319-72487-4_6
Rich square-free words
Jetro VestiTheoretical Computer Science 687 48 (2017)
https://doi.org/10.1016/j.tcs.2017.05.003
A geometric interpretation of the Schützenberger group of a minimal subshift
Jorge Almeida and Alfredo CostaArkiv för Matematik 54 (2) 243 (2016)
https://doi.org/10.1007/s11512-016-0233-7
Morphic images of episturmian words having finite palindromic defect
Štěpán StarostaEuropean Journal of Combinatorics 51 359 (2016)
https://doi.org/10.1016/j.ejc.2015.07.001
Developments in Language Theory
Srečko Brlek, Nadia Lafrenière and Xavier ProvençalLecture Notes in Computer Science, Developments in Language Theory 9168 155 (2015)
https://doi.org/10.1007/978-3-319-21500-6_12
Maximal bifix decoding
Valérie Berthé, Clelia De Felice, Francesco Dolce, et al.Discrete Mathematics 338 (5) 725 (2015)
https://doi.org/10.1016/j.disc.2014.12.010
The finite index basis property
Valérie Berthé, Clelia De Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer and Giuseppina RindoneJournal of Pure and Applied Algebra 219 (7) 2521 (2015)
https://doi.org/10.1016/j.jpaa.2014.09.014
On the structure of bispecial Sturmian words
Gabriele FiciJournal of Computer and System Sciences 80 (4) 711 (2014)
https://doi.org/10.1016/j.jcss.2013.11.001
https://doi.org/10.1002/9781119042853.biblio
https://doi.org/10.1002/9781119008200.biblio
Developments in Language Theory
Aldo de Luca, Elena V. Pribavkina and Luca Q. ZamboniLecture Notes in Computer Science, Developments in Language Theory 7907 191 (2013)
https://doi.org/10.1007/978-3-642-38771-5_18
BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS
VALÉRIE BERTHÉ, JULIEN CASSAIGNE and WOLFGANG STEINERInternational Journal of Algebra and Computation 23 (04) 689 (2013)
https://doi.org/10.1142/S0218196713400043
Further Developments in Fractals and Related Fields
Pierre Arnoux and Štěpán StarostaFurther Developments in Fractals and Related Fields 1 (2013)
https://doi.org/10.1007/978-0-8176-8400-6_1
Introducing privileged words: Privileged complexity of Sturmian words
Jarkko PeltomäkiTheoretical Computer Science 500 57 (2013)
https://doi.org/10.1016/j.tcs.2013.05.028
Lamination languages
LUIS-MIGUEL LOPEZ and PHILIPPE NARBELErgodic Theory and Dynamical Systems 33 (6) 1813 (2013)
https://doi.org/10.1017/etds.2012.114
A standard correspondence on epicentral words
Aldo de LucaEuropean Journal of Combinatorics 33 (7) 1514 (2012)
https://doi.org/10.1016/j.ejc.2012.03.015
Bifix codes and Sturmian words
Jean Berstel, Clelia De Felice, Dominique Perrin, Christophe Reutenauer and Giuseppina RindoneJournal of Algebra 369 146 (2012)
https://doi.org/10.1016/j.jalgebra.2012.07.013
On theta-palindromic richness
Štěpán StarostaTheoretical Computer Science 412 (12-14) 1111 (2011)
https://doi.org/10.1016/j.tcs.2010.12.011
Special factors and the combinatorics of suffix and factor automata
Gabriele FiciTheoretical Computer Science 412 (29) 3604 (2011)
https://doi.org/10.1016/j.tcs.2011.03.007
On the fixed points of the iterated pseudopalindromic closure operator
D. Jamet, G. Paquin, G. Richomme and L. VuillonTheoretical Computer Science 412 (27) 2974 (2011)
https://doi.org/10.1016/j.tcs.2010.03.018
A palindromization map on free monoids
Aldo de LucaProceedings of the Steklov Institute of Mathematics 274 (1) 124 (2011)
https://doi.org/10.1134/S0081543811060095
Balance and Abelian complexity of the Tribonacci word
Gwénaël Richomme, Kalle Saari and Luca Q. ZamboniAdvances in Applied Mathematics 45 (2) 212 (2010)
https://doi.org/10.1016/j.aam.2010.01.006
On the number of episturmian palindromes
Michelangelo Bucci, Aldo de Luca and Alessandro De LucaTheoretical Computer Science 411 (40-42) 3668 (2010)
https://doi.org/10.1016/j.tcs.2010.06.016
Sturmian jungle (or garden?) on multiliteral alphabets
L'ubomíra Balková, Edita Pelantová and Štěpán StarostaRAIRO - Theoretical Informatics and Applications 44 (4) 443 (2010)
https://doi.org/10.1051/ita/2011002
Standard factors of Sturmian words
Gwénaël Richomme, Kalle Saari and Luca Q. ZamboniRAIRO - Theoretical Informatics and Applications 44 (1) 159 (2010)
https://doi.org/10.1051/ita/2010011
Counting distinct palindromes in a word in linear time
Richard Groult, Élise Prieur and Gwénaël RichommeInformation Processing Letters 110 (20) 908 (2010)
https://doi.org/10.1016/j.ipl.2010.07.018
Developments in Language Theory
Antonio Restivo and Giovanna RosoneLecture Notes in Computer Science, Developments in Language Theory 5583 431 (2009)
https://doi.org/10.1007/978-3-642-02737-6_35
On a generalization of Christoffel words: epichristoffel words
Geneviève PaquinTheoretical Computer Science 410 (38-40) 3782 (2009)
https://doi.org/10.1016/j.tcs.2009.05.014
A new characteristic property of rich words
Michelangelo Bucci, Alessandro De Luca, Amy Glen and Luca Q. ZamboniTheoretical Computer Science 410 (30-32) 2860 (2009)
https://doi.org/10.1016/j.tcs.2008.11.001