An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with the property that no two holes are within distance d. Our algorithm runs in O(nd) time and is used for the study of freeness of partial words. Furthermore, we construct an infinite word over a five-letter alphabet that is overlap-free even after the insertion of an arbitrary number of holes, answering affirmatively a conjecture from Blanchet-Sadri, Mercaş, and Scott.
Unable to display preview. Download preview PDF.
- 2.Blanchet-Sadri, F., Mercaş, R., Scott, G.: A generalization of Thue freeness for partial words. Theoretical Computer Science (2008), doi:10.1016/j.tcs.2008.11.006Google Scholar
- 5.Halava, V., Harju, T., Kärki, T.: Overlap-freeness in infinite partial words. Technical Report 888, Turku Centre for Computer Science (2008)Google Scholar