On a characteristic property of ARNOUX–RAUZY sequences
RAIRO-Theor. Inf. Appl., 36 4 (2002) 385-388
Published online: 2003-02-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):
On z-factorization and c-factorization of standard episturmian words
N. Ghareghani, M. Mohammad-Noori and P. SharifaniTheoretical Computer Science 412 (39) 5232 (2011)
https://doi.org/10.1016/j.tcs.2011.05.035
Episturmian words: a survey
Amy Glen and Jacques JustinRAIRO - Theoretical Informatics and Applications 43 (3) 403 (2009)
https://doi.org/10.1051/ita/2009003
Directive words of episturmian words: equivalences and normalization
Amy Glen, Florence Levé and Gwénaël RichommeRAIRO - Theoretical Informatics and Applications 43 (2) 299 (2009)
https://doi.org/10.1051/ita:2008029
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
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
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
Study of irreducible balanced pairs for substitutive languages
Julien BernatRAIRO - Theoretical Informatics and Applications 42 (4) 663 (2008)
https://doi.org/10.1051/ita:2007062
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
Algebraic Informatics
Jean BerstelLecture Notes in Computer Science, Algebraic Informatics 4728 23 (2007)
https://doi.org/10.1007/978-3-540-75414-5_2
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
G. RichommeTheoretical Computer Science 380 (3) 393 (2007)
https://doi.org/10.1016/j.tcs.2007.03.028
Inequalities characterizing standard Sturmian and episturmian words
Giuseppe PirilloTheoretical Computer Science 341 (1-3) 276 (2005)
https://doi.org/10.1016/j.tcs.2005.04.008
Characterisations of balanced words via orderings
Oliver Jenkinson and Luca Q. ZamboniTheoretical Computer Science 310 (1-3) 247 (2004)
https://doi.org/10.1016/S0304-3975(03)00397-9