Restricted Square Property and Infinite Partial Words - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports (Research Report) Year : 2009

Restricted Square Property and 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.
No file

Dates and versions

lirmm-00408116 , version 1 (25-08-2009)

Identifiers

  • HAL Id : lirmm-00408116 , version 1

Cite

Patrice Séébold, Vesa Halava, Tero Harju, Tomi Kärki. Restricted Square Property and Infinite Partial Words. [Research Report] RR-09025/930, Lirmm; Turku Centre for Computer Science. 2009, pp.16. ⟨lirmm-00408116⟩
169 View
0 Download

Share

Gmail Facebook X LinkedIn More