Overlap-freeness in infinite partial words
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 -over...
Gespeichert in:
Veröffentlicht in: | Theoretical computer science 2009-03, Vol.410 (8), p.943-948 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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
x
y
x
y
x
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. |
---|---|
ISSN: | 0304-3975 1879-2294 |
DOI: | 10.1016/j.tcs.2008.12.041 |