Bounds for the generalized repetition threshold

The notion of repetition threshold, which is the object of Dejean’s conjecture (1972), was generalized by Ilie, Ochem, and Shallit in 2005, to include the lengths of the avoided words. We give a lower and an upper bound on this generalized repetition threshold.

• Type: Journal
• Year: 2011
• Where: TCS
• Authors: Francesca Fiorenzi, Pascal Ochem, Elise Vaslet
• Keywords: Avoided Words, Repetition Threshold, TCS 2011, Theoretical Computer Science, Upper Bound