Logo image
Sign in
Overlap-Freeness in Infinite Partial Words
Journal article   Open access   Peer reviewed

Overlap-Freeness in Infinite Partial Words

Vesa Halava, Tero Harju, Tomi Kärki and Patrice Séébold
Theoretical Computer Science, Vol.410, pp.943-948
2009

Abstract

infinite words Thue-Morse word partial words overlap k-free restricted square property Repetition-freeness
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.
url
Find in HALView
url
https://doi.org/10.1016/j.tcs.2008.12.041View
Published (Version of record) Open

Metrics

1 Record Views

Details

Logo image