EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues RAIRO-Theor. Inf. Appl., 34 5 (2000) 343-356 Article references

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):

A History of Folding in Mathematics

Michael Friedman
Science Networks. Historical Studies, A History of Folding in Mathematics 59 355 (2018)
DOI: 10.1007/978-3-319-72487-4_6
See this article

Reversible Christoffel factorizations

Michelangelo Bucci, Alessandro De Luca and Luca Q. Zamboni
Theoretical Computer Science 495 17 (2013)
DOI: 10.1016/j.tcs.2013.05.042
See this article

Occurrences of palindromes in characteristic Sturmian words

Amy Glen
Theoretical Computer Science 352 (1-3) 31 (2006)
DOI: 10.1016/j.tcs.2005.09.075
See this article

Developments in Language Theory

Gwénaël Richomme
Lecture Notes in Computer Science, Developments in Language Theory 4588 371 (2007)
DOI: 10.1007/978-3-540-73208-2_35
See this article

Squares and cubes in Sturmian sequences

Artūras Dubickas
RAIRO - Theoretical Informatics and Applications 43 (3) 615 (2009)
DOI: 10.1051/ita/2009005
See this article

A characterization of fine words over a finite alphabet

Amy Glen
Theoretical Computer Science 391 (1-2) 51 (2008)
DOI: 10.1016/j.tcs.2007.10.029
See this article

Dejean’s conjecture and Sturmian words

M. Mohammad-Noori and James D. Currie
European Journal of Combinatorics 28 (3) 876 (2007)
DOI: 10.1016/j.ejc.2005.11.005
See this article

Developments in Language Theory

Francesco Dolce and Dominique Perrin
Lecture Notes in Computer Science, Developments in Language Theory 9168 215 (2015)
DOI: 10.1007/978-3-319-21500-6_17
See this article

Maximal bifix decoding

Valérie Berthé, Clelia De Felice, Francesco Dolce, et al.
Discrete Mathematics 338 (5) 725 (2015)
DOI: 10.1016/j.disc.2014.12.010
See this article

Sturmian jungle (or garden?) on multiliteral alphabets

L'ubomíra Balková, Edita Pelantová and Štěpán Starosta
RAIRO - Theoretical Informatics and Applications 44 (4) 443 (2010)
DOI: 10.1051/ita/2011002
See this article

Abelian returns in Sturmian words

Svetlana Puzynina and Luca Q. Zamboni
Journal of Combinatorial Theory, Series A 120 (2) 390 (2013)
DOI: 10.1016/j.jcta.2012.09.002
See this article

RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS

JEAN BERSTEL
International Journal of Algebra and Computation 12 (01n02) 371 (2002)
DOI: 10.1142/S021819670200095X
See this article

On a generalization of Christoffel words: epichristoffel words

Geneviève Paquin
Theoretical Computer Science 410 (38-40) 3782 (2009)
DOI: 10.1016/j.tcs.2009.05.014
See this article

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)
DOI: 10.1016/j.jpaa.2014.09.028
See this article

Abelian returns in Sturmian words

Svetlana Puzynina and Luca Q. Zamboni
Electronic Proceedings in Theoretical Computer Science 63 179 (2011)
DOI: 10.4204/EPTCS.63.24
See this article

Acyclic, connected and tree sets

Valérie Berthé, Clelia De Felice, Francesco Dolce, et al.
Monatshefte für Mathematik 176 (4) 521 (2015)
DOI: 10.1007/s00605-014-0721-4
See this article

A new geometric approach to Sturmian words

Kaisa Matomäki and Kalle Saari
Theoretical Computer Science 432 77 (2012)
DOI: 10.1016/j.tcs.2012.01.040
See this article

Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers

Karel Klouda and Edita Pelantová
Integers 9 (3) 281 (2009)
DOI: 10.1515/INTEG.2009.025
See this article

Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials

David Damanik and Daniel Lenz
Journal de Mathématiques Pures et Appliquées 85 (5) 671 (2006)
DOI: 10.1016/j.matpur.2005.11.002
See this article

Characterizations of finite and infinite episturmian words via lexicographic orderings

Amy Glen, Jacques Justin and Giuseppe Pirillo
European Journal of Combinatorics 29 (1) 45 (2008)
DOI: 10.1016/j.ejc.2007.01.002
See this article

Hierarchical structures in Sturmian dynamical systems

Daniel Lenz
Theoretical Computer Science 303 (2-3) 463 (2003)
DOI: 10.1016/S0304-3975(03)00207-X
See this article

Quasiperiodic and Lyndon episturmian words

Amy Glen, Florence Levé and Gwénaël Richomme
Theoretical Computer Science 409 (3) 578 (2008)
DOI: 10.1016/j.tcs.2008.09.056
See this article

COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS

D. DAMANIK and LUCA Q. ZAMBONI
Reviews in Mathematical Physics 15 (07) 745 (2003)
DOI: 10.1142/S0129055X03001758
See this article

Formal Languages, Automata and Numeration Systems 1

Formal Languages, Automata and Numeration Systems 1 257 (2014)
DOI: 10.1002/9781119008200.biblio
See this article

Some algorithms to compute the conjugates of Episturmian morphisms

Gwenael Richomme
RAIRO - Theoretical Informatics and Applications 37 (1) 85 (2003)
DOI: 10.1051/ita:2003009
See this article

Palindromic complexity of codings of rotations

A. Blondin Massé, S. Brlek, S. Labbé and L. Vuillon
Theoretical Computer Science 412 (46) 6455 (2011)
DOI: 10.1016/j.tcs.2011.08.007
See this article

Episturmian words: a survey

Amy Glen and Jacques Justin
RAIRO - Theoretical Informatics and Applications 43 (3) 403 (2009)
DOI: 10.1051/ita/2009003
See this article

Recent results on syntactic groups of prefix codes

Jean Berstel, Clelia De Felice, Dominique Perrin, Christophe Reutenauer and Giuseppina Rindone
European Journal of Combinatorics 33 (7) 1386 (2012)
DOI: 10.1016/j.ejc.2012.03.004
See this article

Episturmian words and episturmian morphisms

Jacques Justin and Giuseppe Pirillo
Theoretical Computer Science 276 (1-2) 281 (2002)
DOI: 10.1016/S0304-3975(01)00207-9
See this article

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)
DOI: 10.1016/j.jpaa.2014.09.014
See this article

Powers in a class of A-strict standard episturmian words

Amy Glen
Theoretical Computer Science 380 (3) 330 (2007)
DOI: 10.1016/j.tcs.2007.03.023
See this article

On θ-episturmian words

Michelangelo Bucci, Aldo de Luca, Alessandro De Luca and Luca Q. Zamboni
European Journal of Combinatorics 30 (2) 473 (2009)
DOI: 10.1016/j.ejc.2008.04.010
See this article

Formal Languages, Automata and Numeration Systems 2

Formal Languages, Automata and Numeration Systems 2 193 (2014)
DOI: 10.1002/9781119042853.biblio
See this article

Kernel words and gap sequence of the tribonacci sequence

Yuke HUANG and Zhiying WEN
Acta Mathematica Scientia 36 (1) 173 (2016)
DOI: 10.1016/S0252-9602(15)30086-2
See this article

Conjugacy and episturmian morphisms

G. Richomme
Theoretical Computer Science 302 (1-3) 1 (2003)
DOI: 10.1016/S0304-3975(02)00726-0
See this article

Palindromic richness

Amy Glen, Jacques Justin, Steve Widmer and Luca Q. Zamboni
European Journal of Combinatorics 30 (2) 510 (2009)
DOI: 10.1016/j.ejc.2008.04.006
See this article

Bifix codes and Sturmian words

Jean Berstel, Clelia De Felice, Dominique Perrin, Christophe Reutenauer and Giuseppina Rindone
Journal of Algebra 369 146 (2012)
DOI: 10.1016/j.jalgebra.2012.07.013
See this article

Profinite Semigroups and Symbolic Dynamics

Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou and Dominique Perrin
Lecture Notes in Mathematics, Profinite Semigroups and Symbolic Dynamics 2274 169 (2020)
DOI: 10.1007/978-3-030-55215-2_6
See this article

Palindromic language of thin discrete planes

Eric Domenjoud, Xavier Provençal and Laurent Vuillon
Theoretical Computer Science 624 101 (2016)
DOI: 10.1016/j.tcs.2015.11.023
See this article

Combinatorics on Words

Kateřina Medková
Lecture Notes in Computer Science, Combinatorics on Words 11682 251 (2019)
DOI: 10.1007/978-3-030-28796-2_20
See this article

Developments in Language Theory

Dominique Perrin
Lecture Notes in Computer Science, Developments in Language Theory 11088 60 (2018)
DOI: 10.1007/978-3-319-98654-8_5
See this article

Sequences with constant number of return words

L’ubomíra Balková, Edita Pelantová and Wolfgang Steiner
Monatshefte für Mathematik 155 (3-4) 251 (2008)
DOI: 10.1007/s00605-008-0001-2
See this article

Morphic images of episturmian words having finite palindromic defect

Štěpán Starosta
European Journal of Combinatorics 51 359 (2016)
DOI: 10.1016/j.ejc.2015.07.001
See this article

Interval exchanges, admissibility and branching Rauzy induction

Francesco Dolce and Dominique Perrin
RAIRO - Theoretical Informatics and Applications 51 (3) 135 (2017)
DOI: 10.1051/ita/2017004
See this article

Abelian periods of factors of Sturmian words

Jarkko Peltomäki
Journal of Number Theory 214 251 (2020)
DOI: 10.1016/j.jnt.2020.04.007
See this article

Neutral and tree sets of arbitrary characteristic

Francesco Dolce and Dominique Perrin
Theoretical Computer Science 658 159 (2017)
DOI: 10.1016/j.tcs.2016.01.008
See this article

On non-repetitive complexity of Arnoux–Rauzy words

Kateřina Medková, Edita Pelantová and Élise Vandomme
Discrete Applied Mathematics 285 423 (2020)
DOI: 10.1016/j.dam.2020.06.016
See this article

A characterization of Sturmian sequences by indistinguishable asymptotic pairs

Sebastián Barbieri, Sébastien Labbé and Štěpán Starosta
European Journal of Combinatorics 95 103318 (2021)
DOI: 10.1016/j.ejc.2021.103318
See this article

A condition of Boshernitzan and uniform convergence in the multiplicative ergodic theorem

David Damanik and Daniel Lenz
Duke Mathematical Journal 133 (1) (2006)
DOI: 10.1215/S0012-7094-06-13314-8
See this article

On generating binary words palindromically

Tero Harju, Mari Huova and Luca Q. Zamboni
Journal of Combinatorial Theory, Series A 129 142 (2015)
DOI: 10.1016/j.jcta.2014.10.003
See this article

Isabel M. Araújo and Véronique Bruyère
3572 122 (2005)
DOI: 10.1007/11505877_11
See this article