no. 2
A linear-time algorithm to decide whether a binary word contains an overlap
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 2, pp. 135-145. 
@article{ITA_1988__22_2_135_0,
     author = {Kfoury, A. J.},
     title = {A linear-time algorithm to decide whether a binary word contains an overlap},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {135--145},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {2},
     year = {1988},
     mrnumber = {951335},
     zbl = {0645.68087},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1988__22_2_135_0/}
}
TY  - JOUR
AU  - Kfoury, A. J.
TI  - A linear-time algorithm to decide whether a binary word contains an overlap
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1988
SP  - 135
EP  - 145
VL  - 22
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1988__22_2_135_0/
LA  - en
ID  - ITA_1988__22_2_135_0
ER  - 
%0 Journal Article
%A Kfoury, A. J.
%T A linear-time algorithm to decide whether a binary word contains an overlap
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1988
%P 135-145
%V 22
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1988__22_2_135_0/
%G en
%F ITA_1988__22_2_135_0
Kfoury, A. J. A linear-time algorithm to decide whether a binary word contains an overlap. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 2, pp. 135-145. http://archive.numdam.org/item/ITA_1988__22_2_135_0/

1.J. Berstel, Some Recent Results on Squarefree Words Proc. of Symposium on Theoretical Aspects of Computer Science, 11-13 April 1984 , Paris. | MR | Zbl

2. M. Crochemore, Linear Searching for a Square in a Word, Bulletin of EATCS, No. 24, Oct. 1984, pp. 66-72. | MR

3. A. J. Kfoury, Square-Free and Overlap-Free Words, Technical Report, Department of Computer Science, Boston University, 1985.

4. M. Lothaire, Combinatorics on Words, Addison-Wesley, 1983. | MR | Zbl

5. A. Resttvo and S. Salemi, Overlap Free Words on Two Symbols, in Automata on Infinité Words, Nivat and Perrin Ed., LNCS 192, Springer-Verlag, 1985, pp. 198-206. | MR | Zbl

6. A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, 1981. | MR | Zbl