Bounds for the Generalized Repetition Threshold

Abstract : 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 de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2011, 412 (27), pp.2955-2963
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00739391
Contributeur : Pascal Ochem <>
Soumis le : lundi 8 octobre 2012 - 10:39:08
Dernière modification le : jeudi 24 mai 2018 - 15:59:22

Identifiants

  • HAL Id : lirmm-00739391, version 1

Citation

Francesca Fiorenzi, Pascal Ochem, Elise Vaslet. Bounds for the Generalized Repetition Threshold. Theoretical Computer Science, Elsevier, 2011, 412 (27), pp.2955-2963. 〈lirmm-00739391〉

Partager

Métriques

Consultations de la notice

190