Overlap-Freeness in Infinite Partial Words - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Theoretical Computer Science Year : 2009

Overlap-Freeness in Infinite Partial Words

Vesa Halava
  • Function : Author
  • PersonId : 860207
Tero Harju
  • Function : Author
  • PersonId : 860208
Tomi Kärki
  • Function : Author
  • PersonId : 860209

Abstract

We prove that there exist infinitely many infinite overlap-free binary partial words containing at least one hole. Moreover, we show that these words cannot contain more than one hole and the only hole must occur either in the first or in the second position.We define that a partial word is k-overlap-free if it does not contain a factor of the form xyxyx where the length of x is at least k. We prove that there exist infinitely many 2-overlap-free binary partial words containing an infinite number of holes.
Fichier principal
Vignette du fichier
TCS7276.pdf (510.77 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

lirmm-00382675 , version 1 (22-05-2009)

Identifiers

Cite

Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold. Overlap-Freeness in Infinite Partial Words. Theoretical Computer Science, 2009, 410, pp.943-948. ⟨10.1016/j.tcs.2008.12.041⟩. ⟨lirmm-00382675⟩
103 View
198 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More