Answers are grounded in this paper and cite their sources.
A linear-time algorithm to decide whether a binary word contains an overlapInformatique théorique et applications, tome 22, n o 2 (1988), p. 135-145.
No takes yet. Share an insight, caveat, or question.
A. J. Kfoury (1986) studied this question.
Synapse has enriched 6 related papers. Consider them for comparative context: