| Issue |
RAIRO-Theor. Inf. Appl.
Volume 44, Number 3, July-September 2010
|
|
|---|---|---|
| Page(s) | 281 - 292 | |
| DOI | https://doi.org/10.1051/ita/2010015 | |
| Published online | 23 June 2010 | |
On the D0L Repetition Threshold
Department of Mathematics, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel;
ilyago@bgu.ac.il
Received:
14
August
2009
Accepted:
20
May
2010
The repetition threshold is a measure of the extent to which there need to be consecutive (partial) repetitions of finite words within infinite words over alphabets of various sizes. Dejean's Conjecture, which has been recently proven, provides this threshold for all alphabet sizes. Motivated by a question of Krieger, we deal here with the analogous threshold when the infinite word is restricted to be a D0L word. Our main result is that, asymptotically, this threshold does not exceed the unrestricted threshold by more than a little.
Mathematics Subject Classification: 68R15
© EDP Sciences, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.