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

Binary words with a given Diophantine exponent

Artūras Dubickas
Theoretical Computer Science 410 (47-49) 5191 (2009)
DOI: 10.1016/j.tcs.2009.08.013
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

Optimality of some algorithms to detect quasiperiodicities

R. Groult and G. Richomme
Theoretical Computer Science 411 (34-36) 3110 (2010)
DOI: 10.1016/j.tcs.2010.04.039
See this article

A generalization of the Fibonacci word fractal and the Fibonacci snowflake

José L. Ramírez, Gustavo N. Rubiano and Rodrigo De Castro
Theoretical Computer Science 528 40 (2014)
DOI: 10.1016/j.tcs.2014.02.003
See this article

SOME EXTREMAL PROPERTIES OF THE FIBONACCI WORD

ALDO DE LUCA
International Journal of Algebra and Computation 23 (04) 705 (2013)
DOI: 10.1142/S0218196713400055
See this article

Standard factors of Sturmian words

Gwénaël Richomme, Kalle Saari and Luca Q. Zamboni
RAIRO - Theoretical Informatics and Applications 44 (1) 159 (2010)
DOI: 10.1051/ita/2010011
See this article

Locally catenative sequences and Turtle graphics

Juhani Karhumäki and Svetlana Puzynina
RAIRO - Theoretical Informatics and Applications 45 (3) 311 (2011)
DOI: 10.1051/ita/2011104
See this article

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

Lyndon words and Fibonacci numbers

Kalle Saari
Journal of Combinatorial Theory, Series A 121 34 (2014)
DOI: 10.1016/j.jcta.2013.09.002
See this article