Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

TCS
2011

favoriteEmaildiscussreport

211views Theoretical Computer Science» more TCS 2011»

Bounds for the generalized repetition threshold

12 years 11 months ago

Bounds for the generalized repetition threshold

Download www.lri.fr

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.

Francesca Fiorenzi, Pascal Ochem, Elise Vaslet

Real-time Traffic

Avoided Words | Repetition Threshold | TCS 2011 | Theoretical Computer Science | Upper Bound |

claim paper

Related Content

» A Generalization of Repetition Threshold

» Twodimensional interleaving schemes with repetitions Constructions and bounds

» ChernoffType Direct Product Theorems

» Structural Defects General Approach and Application to Textile Inspection

» Admission control to minimize rejections and online set cover with repetitions

» Weights of Exact Threshold Functions

» Quantum Search on BoundedError Inputs

» CramerRao lower bound on doppler frequency of coherent pulse trains

» Powering requires threshold depth 3

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TCS
Authors	Francesca Fiorenzi, Pascal Ochem, Elise Vaslet

Comments (0)