Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Dubickas, Artūras
2009.
Squares and cubes in Sturmian sequences.
RAIRO - Theoretical Informatics and Applications,
Vol. 43,
Issue. 3,
p.
615.
Dubickas, Artūras
2009.
Binary words with a given Diophantine exponent.
Theoretical Computer Science,
Vol. 410,
Issue. 47-49,
p.
5191.
Richomme, Gwénaël
Saari, Kalle
and
Zamboni, Luca Q.
2010.
Standard factors of Sturmian words.
RAIRO - Theoretical Informatics and Applications,
Vol. 44,
Issue. 1,
p.
159.
Groult, R.
and
Richomme, G.
2010.
Optimality of some algorithms to detect quasiperiodicities.
Theoretical Computer Science,
Vol. 411,
Issue. 34-36,
p.
3110.
Jamet, D.
Paquin, G.
Richomme, G.
and
Vuillon, L.
2011.
On the fixed points of the iterated pseudopalindromic closure operator.
Theoretical Computer Science,
Vol. 412,
Issue. 27,
p.
2974.
Karhumäki, Juhani
and
Puzynina, Svetlana
2011.
Locally catenative sequences and Turtle graphics.
RAIRO - Theoretical Informatics and Applications,
Vol. 45,
Issue. 3,
p.
311.
DE LUCA, ALDO
2013.
SOME EXTREMAL PROPERTIES OF THE FIBONACCI WORD.
International Journal of Algebra and Computation,
Vol. 23,
Issue. 04,
p.
705.
Ramírez, José L.
Rubiano, Gustavo N.
and
De Castro, Rodrigo
2014.
A generalization of the Fibonacci word fractal and the Fibonacci snowflake.
Theoretical Computer Science,
Vol. 528,
Issue. ,
p.
40.
Saari, Kalle
2014.
Lyndon words and Fibonacci numbers.
Journal of Combinatorial Theory, Series A,
Vol. 121,
Issue. ,
p.
34.
Peltomäki, Jarkko
2020.
Abelian periods of factors of Sturmian words.
Journal of Number Theory,
Vol. 214,
Issue. ,
p.
251.
Ghareghani, N.
and
Sharifani, P.
2021.
On square factors and critical factors of k-bonacci words on infinite alphabet.
Theoretical Computer Science,
Vol. 865,
Issue. ,
p.
34.
Gabric, Daniel
Rampersad, Narad
and
Shallit, Jeffrey
2021.
An Inequality for the Number of Periods in a Word.
International Journal of Foundations of Computer Science,
Vol. 32,
Issue. 05,
p.
597.
Cassaigne, Julien
and
Kaboré, Idrissa
2022.
On the Complexity of the Generalized Fibonacci Words.
RAIRO - Theoretical Informatics and Applications,
Vol. 56,
Issue. ,
p.
5.
Dvořáková, L'ubomíra
and
Pelantová, Edita
2024.
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence.
Theoretical Computer Science,
Vol. 995,
Issue. ,
p.
114490.
Dvořáková, L’ubomíra
and
Pelantová, Edita
2024.
The repetition threshold of episturmian sequences.
European Journal of Combinatorics,
Vol. 120,
Issue. ,
p.
104001.