Bounds for the Generalized Repetition Threshold - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2011

Bounds for the Generalized Repetition Threshold

Résumé

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.

Dates et versions

lirmm-00739391 , version 1 (08-10-2012)

Identifiants

Citer

Francesca Fiorenzi, Pascal Ochem, Elise Vaslet. Bounds for the Generalized Repetition Threshold. Theoretical Computer Science, 2011, 412 (27), pp.2955-2963. ⟨10.1016/j.tcs.2010.10.009⟩. ⟨lirmm-00739391⟩
123 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More