Consider a finite alphabet Ω and strings consisting of elements from Ω. For a given string w, let cor(w) denote the autocorrelation, which can be seen as a measure of the amount of overlap in w. Furthermore, let aw(n) be the number of strings of length n that do not contain w as a substring. Eriksson  stated the following conjecture: if cor(w)>cor(w… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.