no. 4
Enumeration of bordered words, le langage de la vache-qui-rit
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 4, pp. 303-317 
@article{ITA_1992__26_4_303_0,
     author = {R\'egnier, M.},
     title = {Enumeration of bordered words, le langage de la vache-qui-rit},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {303--317},
     year = {1992},
     publisher = {EDP Sciences},
     volume = {26},
     number = {4},
     mrnumber = {1173172},
     zbl = {0754.68089},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1992__26_4_303_0/}
}
TY  - JOUR
AU  - Régnier, M.
TI  - Enumeration of bordered words, le langage de la vache-qui-rit
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1992
SP  - 303
EP  - 317
VL  - 26
IS  - 4
PB  - EDP Sciences
UR  - https://www.numdam.org/item/ITA_1992__26_4_303_0/
LA  - en
ID  - ITA_1992__26_4_303_0
ER  - 
%0 Journal Article
%A Régnier, M.
%T Enumeration of bordered words, le langage de la vache-qui-rit
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1992
%P 303-317
%V 26
%N 4
%I EDP Sciences
%U https://www.numdam.org/item/ITA_1992__26_4_303_0/
%G en
%F ITA_1992__26_4_303_0
Régnier, M. Enumeration of bordered words, le langage de la vache-qui-rit. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 4, pp. 303-317. https://www.numdam.org/item/ITA_1992__26_4_303_0/

[CP] M. Crochemore and D. Perrin, Pattern matching in strings, L.I.T.P., Paris, Research Report, 88-5.

[Dar78] G. Darboux, Mémoire sur l'approximation des fonctions de très grands nombres, et sur une classe étendue de développements en série, J. Math. Pures Appl., février 1978, pp. 5-56, 377-416. | JFM | Numdam

[Fla84] Flajolet, Algorithmique, in Encyclopedia Universalis, 1, pp. 758-763. Éditions de l'E. U., 1984.

[GJ83] I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, John Wiley, New York, 1983. | Zbl | MR

[Lot83] Lothaire, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983. | Zbl | MR

[Odl85] A. Odlyzko, Enumeration of strings, in A. APOSTOLICO and Z. GALIL Ed., Combinatorial Algorithms on Words, 12 of NATO Advance Science Institute Series, Series F: Computer and Systems Sciences, pp. 203-228, Springer Verlag, 1985. | Zbl | MR

{Rég89] M. Régnier, Knuth-Morris-Pratt algorithm: an analysis, in MFCS'89, 379, Lecture Notes in Comput. Sci., pp. 431-444, Springer-Verlag, 1989. Proc. Mathematical Foundations for Computer Science 89, Porubka, Poland. | Zbl | MR

[Ste84] J.-M. Steyaert, Structure et complexité des algorithmes. Thèse d'État, Université de Paris-VII, 1984.