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:
J. Berstel, P. Séébold
RAIRO-Theor. Inf. Appl., 28 3-4 (1994) 255-263
Published online: 2017-02-03
This article has been cited by the following article(s):
On the subword equivalence problem for morphic words
Isabelle Fagnot
Discrete Applied Mathematics 75 (3) 231 (1997)
DOI: 10.1016/S0166-218X(97)89162-7
See this article
A little more about morphic Sturmian words
Isabelle Fagnot
RAIRO - Theoretical Informatics and Applications 40 (3) 511 (2006)
DOI: 10.1051/ita:2006031
See this article
α-Words and factors of characteristic sequences
Wai-Fong Chuan
Discrete Mathematics 177 (1-3) 33 (1997)
DOI: 10.1016/S0012-365X(96)00355-X
See this article
On the conjugation of standard morphisms
Patrice Séébold
Theoretical Computer Science 195 (1) 91 (1998)
DOI: 10.1016/S0304-3975(97)00159-X
See this article
Standard sturmian morphisms
Aldo de Luca
Theoretical Computer Science 178 (1-2) 205 (1997)
DOI: 10.1016/S0304-3975(96)00054-0
See this article
EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
JACQUES JUSTIN and GIUSEPPE PIRILLO
International Journal of Foundations of Computer Science 15 (02) 329 (2004)
DOI: 10.1142/S0129054104002455
See this article
Look and Say Fibonacci
Patrice Séébold
RAIRO - Theoretical Informatics and Applications 42 (4) 729 (2008)
DOI: 10.1051/ita:2007060
See this article
Sur les facteurs des mots automatiques
Isabelle Fagnot
Theoretical Computer Science 172 (1-2) 67 (1997)
DOI: 10.1016/S0304-3975(96)00239-3
See this article
The sum of digits functions of the Zeckendorf and the base phi expansions
F. Michel Dekking
Theoretical Computer Science 859 70 (2021)
DOI: 10.1016/j.tcs.2021.01.011
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
Hui Rao and Zhi-Ying Wen
401 (2010)
DOI: 10.1007/978-0-8176-4888-6_26
See this article
Sturmian morphisms and α-words
Chuan Wai-Fong
Theoretical Computer Science 225 (1-2) 129 (1999)
DOI: 10.1016/S0304-3975(97)00239-9
See this article
On substitution invariant Sturmian words: an application of Rauzy fractals
Valérie Berthé, Hiromi Ei, Shunji Ito and Hui Rao
RAIRO - Theoretical Informatics and Applications 41 (3) 329 (2007)
DOI: 10.1051/ita:2007026
See this article
Uniform tag systems for paperfolding sequences
Christiane Bercoff
Discrete Applied Mathematics 77 (2) 119 (1997)
DOI: 10.1016/S0166-218X(97)84103-0
See this article
Decimations and sturmian words
Jacques Justin and Giuseppe Pirillo
RAIRO - Theoretical Informatics and Applications 31 (3) 271 (1997)
DOI: 10.1051/ita/1997310302711
See this article
Sturmian words, Lyndon words and trees
Jean Berstel and Aldo de Luca
Theoretical Computer Science 178 (1-2) 171 (1997)
DOI: 10.1016/S0304-3975(96)00101-6
See this article
Morphic words, Beatty sequences and integer images of the Fibonacci language
Michel Dekking
Theoretical Computer Science 809 407 (2020)
DOI: 10.1016/j.tcs.2019.12.036
See this article
Palindromes and Sturmian words
Xavier Droubay and Giuseppe Pirillo
Theoretical Computer Science 223 (1-2) 73 (1999)
DOI: 10.1016/S0304-3975(97)00188-6
See this article
Patrice Séébold
1113 506 (1996)
DOI: 10.1007/3-540-61550-4_174
See this article