Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436218 | Theoretical Computer Science | 2009 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics