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:
Jacques Justin
RAIRO-Theor. Inf. Appl., 39 1 (2005) 207-215
Published online: 2005-03-15
This article has been cited by the following article(s):
30 articles
Obstructions to Return Preservation for Episturmian Morphisms
Valérie Berthé and Herman Goulet-Ouellet Theory of Computing Systems 68 (6) 1512 (2024) https://doi.org/10.1007/s00224-024-10190-y
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
The palindromization map
Dominique Perrin and Christophe Reutenauer Discrete Applied Mathematics 340 202 (2023) https://doi.org/10.1016/j.dam.2023.07.008
Reprint of: Palindromization and construction of Markoff triples
Antoine Abram, Mélodie Lapointe and Christophe Reutenauer Theoretical Computer Science 834 75 (2020) https://doi.org/10.1016/j.tcs.2020.05.042
Palindromization and construction of Markoff triples
Antoine Abram, Mélodie Lapointe and Christophe Reutenauer Theoretical Computer Science 809 21 (2020) https://doi.org/10.1016/j.tcs.2019.10.048
Computation and Combinatorics in Dynamics, Stochastics and Control
Christophe Reutenauer Abel Symposia, Computation and Combinatorics in Dynamics, Stochastics and Control 13 691 (2018) https://doi.org/10.1007/978-3-030-01593-0_24
On Christoffel and standard words and their derivatives
Alma D'Aniello, Aldo de Luca and Alessandro De Luca Theoretical Computer Science 658 122 (2017) https://doi.org/10.1016/j.tcs.2016.05.010
Morphic images of episturmian words having finite palindromic defect
Štěpán Starosta European Journal of Combinatorics 51 359 (2016) https://doi.org/10.1016/j.ejc.2015.07.001
Studies on finite Sturmian words
Christophe Reutenauer Theoretical Computer Science 591 106 (2015) https://doi.org/10.1016/j.tcs.2015.05.003
Sturmian words and the Stern sequence
Aldo de Luca and Alessandro De Luca Theoretical Computer Science 581 26 (2015) https://doi.org/10.1016/j.tcs.2015.02.043
SOME EXTREMAL PROPERTIES OF THE FIBONACCI WORD
ALDO DE LUCA International Journal of Algebra and Computation 23 (04) 705 (2013) https://doi.org/10.1142/S0218196713400055
A generalized palindromization map in free monoids
Aldo de Luca and Alessandro De Luca Theoretical Computer Science 454 109 (2012) https://doi.org/10.1016/j.tcs.2012.01.029
A standard correspondence on epicentral words
Aldo de Luca European Journal of Combinatorics 33 (7) 1514 (2012) https://doi.org/10.1016/j.ejc.2012.03.015
On the fixed points of the iterated pseudopalindromic closure operator
D. Jamet, G. Paquin, G. Richomme and L. Vuillon Theoretical Computer Science 412 (27) 2974 (2011) https://doi.org/10.1016/j.tcs.2010.03.018
A palindromization map on free monoids
Aldo de Luca Proceedings of the Steklov Institute of Mathematics 274 (1) 124 (2011) https://doi.org/10.1134/S0081543811060095
Balancing and clustering of words in the Burrows–Wheeler transform
Antonio Restivo and Giovanna Rosone Theoretical Computer Science 412 (27) 3019 (2011) https://doi.org/10.1016/j.tcs.2010.11.040
On graphs of central episturmian words
Aldo de Luca and Luca Q. Zamboni Theoretical Computer Science 411 (1) 70 (2010) https://doi.org/10.1016/j.tcs.2009.09.003
On the number of episturmian palindromes
Michelangelo Bucci, Aldo de Luca and Alessandro De Luca Theoretical Computer Science 411 (40-42) 3668 (2010) https://doi.org/10.1016/j.tcs.2010.06.016
Involutions of epicentral words
Aldo de Luca and Luca Q. Zamboni European Journal of Combinatorics 31 (3) 867 (2010) https://doi.org/10.1016/j.ejc.2009.07.002
Characteristic morphisms of generalized episturmian words
Michelangelo Bucci, Aldo de Luca and Alessandro De Luca Theoretical Computer Science 410 (30-32) 2840 (2009) https://doi.org/10.1016/j.tcs.2008.12.001
On a generalization of Christoffel words: epichristoffel words
Geneviève Paquin Theoretical Computer Science 410 (38-40) 3782 (2009) https://doi.org/10.1016/j.tcs.2009.05.014
Episturmian words: a survey
Amy Glen and Jacques Justin RAIRO - Theoretical Informatics and Applications 43 (3) 403 (2009) https://doi.org/10.1051/ita/2009003
Developments in Language Theory
Antonio Restivo and Giovanna Rosone Lecture Notes in Computer Science, Developments in Language Theory 5583 431 (2009) https://doi.org/10.1007/978-3-642-02737-6_35
Developments in Language Theory
Michelangelo Bucci, Aldo de Luca and Alessandro De Luca Lecture Notes in Computer Science, Developments in Language Theory 5257 158 (2008) https://doi.org/10.1007/978-3-540-85780-8_12
On some problems related to palindrome closure
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca and Luca Q. Zamboni RAIRO - Theoretical Informatics and Applications 42 (4) 679 (2008) https://doi.org/10.1051/ita:2007064
A palindromization map for the free group
Christian Kassel and Christophe Reutenauer Theoretical Computer Science 409 (3) 461 (2008) https://doi.org/10.1016/j.tcs.2008.09.011
Quasiperiodic and Lyndon episturmian words
Amy Glen, Florence Levé and Gwénaël Richomme Theoretical Computer Science 409 (3) 578 (2008) https://doi.org/10.1016/j.tcs.2008.09.056
On an involution of Christoffel words and Sturmian morphisms
Valérie Berthé, Aldo de Luca and Christophe Reutenauer European Journal of Combinatorics 29 (2) 535 (2008) https://doi.org/10.1016/j.ejc.2007.03.001
On Sturmian and episturmian words, and related topics
Amy Glen Bulletin of the Australian Mathematical Society 74 (1) 155 (2006) https://doi.org/10.1017/S0004972700047559
Pseudopalindrome closure operators in free monoids
Aldo de Luca and Alessandro De Luca Theoretical Computer Science 362 (1-3) 282 (2006) https://doi.org/10.1016/j.tcs.2006.07.009