Return words in Sturmian and episturmian words
RAIRO-Theor. Inf. Appl., 34 5 (2000) 343-356
Published online: 2002-04-15
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):
Derived sequences of the (n, j)-bonacci sequences
Yuke Huang and Zhiying WenNonlinearity 38 (3) 035006 (2025)
https://doi.org/10.1088/1361-6544/adaf6d
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
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
GAPS IN THE THUE–MORSE WORD
LUKAS SPIEGELHOFERJournal of the Australian Mathematical Society 114 (1) 110 (2023)
https://doi.org/10.1017/S1446788721000380
Combinatorics on Words
L’ubomíra Dvořáková and Jana LepšováLecture Notes in Computer Science, Combinatorics on Words 13899 130 (2023)
https://doi.org/10.1007/978-3-031-33180-0_10
Closed Ziv–Lempel factorization of the m-bonacci words
Marieh Jahannia, Morteza Mohammad-Noori, Narad Rampersad and Manon StipulantiTheoretical Computer Science 918 32 (2022)
https://doi.org/10.1016/j.tcs.2022.03.019
A characterization of Sturmian sequences by indistinguishable asymptotic pairs
Sebastián Barbieri, Sébastien Labbé and Štěpán StarostaEuropean Journal of Combinatorics 95 103318 (2021)
https://doi.org/10.1016/j.ejc.2021.103318
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 251 (2019)
https://doi.org/10.1007/978-3-030-28796-2_20
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
Developments in Language Theory
Dominique PerrinLecture Notes in Computer Science, Developments in Language Theory 11088 60 (2018)
https://doi.org/10.1007/978-3-319-98654-8_5
Neutral and tree sets of arbitrary characteristic
Francesco Dolce and Dominique PerrinTheoretical Computer Science 658 159 (2017)
https://doi.org/10.1016/j.tcs.2016.01.008
Interval exchanges, admissibility and branching Rauzy induction
Francesco Dolce and Dominique PerrinRAIRO - Theoretical Informatics and Applications 51 (3) 135 (2017)
https://doi.org/10.1051/ita/2017004
Kernel words and gap sequence of the tribonacci sequence
Yuke HUANG and Zhiying WENActa Mathematica Scientia 36 (1) 173 (2016)
https://doi.org/10.1016/S0252-9602(15)30086-2
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
Palindromic language of thin discrete planes
Eric Domenjoud, Xavier Provençal and Laurent VuillonTheoretical Computer Science 624 101 (2016)
https://doi.org/10.1016/j.tcs.2015.11.023
The finite index basis property
Valérie Berthé, Clelia De Felice, Francesco Dolce, et al.Journal of Pure and Applied Algebra 219 (7) 2521 (2015)
https://doi.org/10.1016/j.jpaa.2014.09.014
Bifix codes and interval exchanges
Valérie Berthé, Clelia De Felice, Francesco Dolce, et al.Journal of Pure and Applied Algebra 219 (7) 2781 (2015)
https://doi.org/10.1016/j.jpaa.2014.09.028
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
Developments in Language Theory
Francesco Dolce and Dominique PerrinLecture Notes in Computer Science, Developments in Language Theory 9168 215 (2015)
https://doi.org/10.1007/978-3-319-21500-6_17
On generating binary words palindromically
Tero Harju, Mari Huova and Luca Q. ZamboniJournal of Combinatorial Theory, Series A 129 142 (2015)
https://doi.org/10.1016/j.jcta.2014.10.003
Acyclic, connected and tree sets
Valérie Berthé, Clelia De Felice, Francesco Dolce, et al.Monatshefte für Mathematik 176 (4) 521 (2015)
https://doi.org/10.1007/s00605-014-0721-4
https://doi.org/10.1002/9781119042853.biblio
https://doi.org/10.1002/9781119008200.biblio
Abelian returns in Sturmian words
Svetlana Puzynina and Luca Q. ZamboniJournal of Combinatorial Theory, Series A 120 (2) 390 (2013)
https://doi.org/10.1016/j.jcta.2012.09.002
Reversible Christoffel factorizations
Michelangelo Bucci, Alessandro De Luca and Luca Q. ZamboniTheoretical Computer Science 495 17 (2013)
https://doi.org/10.1016/j.tcs.2013.05.042
Recent results on syntactic groups of prefix codes
Jean Berstel, Clelia De Felice, Dominique Perrin, Christophe Reutenauer and Giuseppina RindoneEuropean Journal of Combinatorics 33 (7) 1386 (2012)
https://doi.org/10.1016/j.ejc.2012.03.004
A new geometric approach to Sturmian words
Kaisa Matomäki and Kalle SaariTheoretical Computer Science 432 77 (2012)
https://doi.org/10.1016/j.tcs.2012.01.040
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
Abelian returns in Sturmian words
Svetlana Puzynina and Luca Q. ZamboniElectronic Proceedings in Theoretical Computer Science 63 179 (2011)
https://doi.org/10.4204/EPTCS.63.24
Palindromic complexity of codings of rotations
A. Blondin Massé, S. Brlek, S. Labbé and L. VuillonTheoretical Computer Science 412 (46) 6455 (2011)
https://doi.org/10.1016/j.tcs.2011.08.007
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
Episturmian words: a survey
Amy Glen and Jacques JustinRAIRO - Theoretical Informatics and Applications 43 (3) 403 (2009)
https://doi.org/10.1051/ita/2009003
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
On θ-episturmian words
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca and Luca Q. ZamboniEuropean Journal of Combinatorics 30 (2) 473 (2009)
https://doi.org/10.1016/j.ejc.2008.04.010
Squares and cubes in Sturmian sequences
Artūras DubickasRAIRO - Theoretical Informatics and Applications 43 (3) 615 (2009)
https://doi.org/10.1051/ita/2009005
Palindromic richness
Amy Glen, Jacques Justin, Steve Widmer and Luca Q. ZamboniEuropean Journal of Combinatorics 30 (2) 510 (2009)
https://doi.org/10.1016/j.ejc.2008.04.006
Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
Karel Klouda and Edita PelantováINTEG 9 (3) 281 (2009)
https://doi.org/10.1515/INTEG.2009.025
Quasiperiodic and Lyndon episturmian words
Amy Glen, Florence Levé and Gwénaël RichommeTheoretical Computer Science 409 (3) 578 (2008)
https://doi.org/10.1016/j.tcs.2008.09.056
Sequences with constant number of return words
L’ubomíra Balková, Edita Pelantová and Wolfgang SteinerMonatshefte für Mathematik 155 (3-4) 251 (2008)
https://doi.org/10.1007/s00605-008-0001-2
Characterizations of finite and infinite episturmian words via lexicographic orderings
Amy Glen, Jacques Justin and Giuseppe PirilloEuropean Journal of Combinatorics 29 (1) 45 (2008)
https://doi.org/10.1016/j.ejc.2007.01.002
A characterization of fine words over a finite alphabet
Amy GlenTheoretical Computer Science 391 (1-2) 51 (2008)
https://doi.org/10.1016/j.tcs.2007.10.029
Dejean’s conjecture and Sturmian words
M. Mohammad-Noori and James D. CurrieEuropean Journal of Combinatorics 28 (3) 876 (2007)
https://doi.org/10.1016/j.ejc.2005.11.005
Powers in a class of A-strict standard episturmian words
Amy GlenTheoretical Computer Science 380 (3) 330 (2007)
https://doi.org/10.1016/j.tcs.2007.03.023
Developments in Language Theory
Gwénaël RichommeLecture Notes in Computer Science, Developments in Language Theory 4588 371 (2007)
https://doi.org/10.1007/978-3-540-73208-2_35
A condition of Boshernitzan and uniform convergence in the multiplicative ergodic theorem
David Damanik and Daniel LenzDuke Mathematical Journal 133 (1) (2006)
https://doi.org/10.1215/S0012-7094-06-13314-8
Occurrences of palindromes in characteristic Sturmian words
Amy GlenTheoretical Computer Science 352 (1-3) 31 (2006)
https://doi.org/10.1016/j.tcs.2005.09.075
Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials
David Damanik and Daniel LenzJournal de Mathématiques Pures et Appliquées 85 (5) 671 (2006)
https://doi.org/10.1016/j.matpur.2005.11.002
Developments in Language Theory
Isabel M. Araújo and Véronique BruyèreLecture Notes in Computer Science, Developments in Language Theory 3572 122 (2005)
https://doi.org/10.1007/11505877_11
Conjugacy and episturmian morphisms
G. RichommeTheoretical Computer Science 302 (1-3) 1 (2003)
https://doi.org/10.1016/S0304-3975(02)00726-0
COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
D. DAMANIK and LUCA Q. ZAMBONIReviews in Mathematical Physics 15 (07) 745 (2003)
https://doi.org/10.1142/S0129055X03001758
Some algorithms to compute the conjugates of Episturmian morphisms
Gwenael RichommeRAIRO - Theoretical Informatics and Applications 37 (1) 85 (2003)
https://doi.org/10.1051/ita:2003009
Hierarchical structures in Sturmian dynamical systems
Daniel LenzTheoretical Computer Science 303 (2-3) 463 (2003)
https://doi.org/10.1016/S0304-3975(03)00207-X
Episturmian words and episturmian morphisms
Jacques Justin and Giuseppe PirilloTheoretical Computer Science 276 (1-2) 281 (2002)
https://doi.org/10.1016/S0304-3975(01)00207-9
RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
JEAN BERSTELInternational Journal of Algebra and Computation 12 (01n02) 371 (2002)
https://doi.org/10.1142/S021819670200095X