A linear-time algorithm to decide whether a binary word contains an overlap

A. J. Kfoury. A linear-time algorithm to decide whether a binary word contains an overlap. Bulletin of the EATCS, 30:74-79, 1986.

@article{Kfoury86,
  title = {A linear-time algorithm to decide whether a binary word contains an overlap},
  author = {A. J. Kfoury},
  year = {1986},
  researchr = {https://researchr.org/publication/Kfoury86},
  cites = {0},
  citedby = {0},
  journal = {Bulletin of the EATCS},
  volume = {30},
  pages = {74-79},
}