| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437596 | Theoretical Computer Science | 2011 | 9 Pages |
Abstract
The notion of the repetition threshold, which is the object of Dejean’s conjecture (1972), was generalized by Ilie et al. (2005) [8] to include the lengths of the avoided words. We give a lower and an upper bound on this generalized repetition threshold.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
