Bounds for the Generalized Repetition Threshold

Francesca Fiorenzi; Pascal Ochem; Elise Vaslet

doi:10.1016/j.tcs.2010.10.009

Journal Articles Theoretical Computer Science Year : 2011

Bounds for the Generalized Repetition Threshold

(1) , (2) , (3)

1
2
3

Francesca Fiorenzi

Function : Author

Laboratoire de Recherche en Informatique

Pascal Ochem

Function : Author
PersonId : 7098
IdHAL : pascal-ochem
ORCID : 0000-0001-5504-4586
IdRef : 109150902

Algorithmes, Graphes et Combinatoire

Elise Vaslet

Function : Author

Institut Mathématiques de Luminy

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.

Domains

Discrete Mathematics [cs.DM]

Pascal Ochem : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00739391

Submitted on : Monday, October 8, 2012-10:39:08 AM

Last modification on : Tuesday, September 3, 2024-1:56:20 PM

Dates and versions

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

Identifiers

HAL Id : lirmm-00739391 , version 1
DOI : 10.1016/j.tcs.2010.10.009

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

EC-PARIS CNRS UNIV-AMU INSMI UMR8623 I2M ALGCO LIRMM TDS-MACS UNIV-PARIS-SACLAY MIPS UNIV-MONTPELLIER

131 View

0 Download

Bounds for the Generalized Repetition Threshold

Abstract

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share