Geodesic
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 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

@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},
     year = {1988},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {2},
     mrnumber = {951335},
     zbl = {0645.68087},
     language = {en},
     url = {http://geodesic.mathdoc.fr/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://geodesic.mathdoc.fr/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://geodesic.mathdoc.fr/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://geodesic.mathdoc.fr/item/ITA_1988__22_2_135_0/