Dejean's conjecture holds for N ≥ 27
RAIRO-Theor. Inf. Appl., 43 4 (2009) 775-778
Published online: 2009-09-29
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):
Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
Julian Pape-LangeInternational Journal of Foundations of Computer Science 34 (02n03) 321 (2023)
https://doi.org/10.1142/S0129054122440075
The undirected repetition threshold and undirected pattern avoidance
James D. Currie and Lucas MolTheoretical Computer Science 866 56 (2021)
https://doi.org/10.1016/j.tcs.2021.03.010
11682 145 (2019)
https://doi.org/10.1007/978-3-030-28796-2_11
Minimal critical exponent of quasiperiodic words
Gwenaël RichommeTheoretical Computer Science 548 117 (2014)
https://doi.org/10.1016/j.tcs.2014.06.039
Growth of Power-Free Languages over Large Alphabets
Arseny M. ShurTheory of Computing Systems 54 (2) 224 (2014)
https://doi.org/10.1007/s00224-013-9512-x
ON PANSIOT WORDS AVOIDING 3-REPETITIONS
IRINA A. GORBUNOVA and ARSENY M. SHURInternational Journal of Foundations of Computer Science 23 (08) 1583 (2012)
https://doi.org/10.1142/S0129054112400631
Growth properties of power-free languages
Arseny M. ShurComputer Science Review 6 (5-6) 187 (2012)
https://doi.org/10.1016/j.cosrev.2012.09.001
Bounds for the generalized repetition threshold
Francesca Fiorenzi, Pascal Ochem and Elise VasletTheoretical Computer Science 412 (27) 2955 (2011)
https://doi.org/10.1016/j.tcs.2010.10.009
Last cases of Dejean’s conjecture
Michaël RaoTheoretical Computer Science 412 (27) 3010 (2011)
https://doi.org/10.1016/j.tcs.2010.06.020
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
Roman Kolpakov and Michaël RaoTheoretical Computer Science 412 (46) 6507 (2011)
https://doi.org/10.1016/j.tcs.2011.08.006
On Pansiot Words Avoiding 3-Repetitions
Irina A. Gorbunova and Arseny M. ShurElectronic Proceedings in Theoretical Computer Science 63 138 (2011)
https://doi.org/10.4204/EPTCS.63.19
On the growth rates of complexity of threshold languages
Arseny M. Shur and Irina A. GorbunovaRAIRO - Theoretical Informatics and Applications 44 (1) 175 (2010)
https://doi.org/10.1051/ita/2010012
On the D0L Repetition Threshold
Ilya GoldsteinRAIRO - Theoretical Informatics and Applications 44 (3) 281 (2010)
https://doi.org/10.1051/ita/2010015