A. V. Aho and M. J. Corasick, EEcient string matching: an aid to bibliographic search, Comm. ACM, vol.18, pp.6-333, 1975.
DOI : 10.1145/360825.360855

M. , F. Mignosi, and A. Restivo, Minimal Forbidden Words and Symbolic Dynamics, STACS'96, pp.555-566, 1996.
URL : https://hal.archives-ouvertes.fr/hal-00619860

J. Cassaigne, Complexit e et Facteurs Sp eciaux, Bull. Belg. Math. Soc, vol.4, pp.67-88, 1997.

M. Crochemore and C. Hancart, Automata for matching patterns, in (Handbook of Formal Languages, Linear Modeling: Background and Application) Chapter 9, pp.399-462, 1997.

V. Diekert and Y. Kobayashi, Some identities related to automata, determinants , and MM obius functions, 1997.

A. De-luca and F. Mignosi, Some combinatorial properties of Sturmian words, Theoretical Computer Science, vol.136, issue.2, pp.361-385, 1994.
DOI : 10.1016/0304-3975(94)00035-H

A. De-luca and L. Mione, On bispecial factors of the Thue???Morse word, Information Processing Letters, vol.49, issue.4, pp.49-179, 1994.
DOI : 10.1016/0020-0190(94)90008-6

R. Mcnaughton and S. Papert, Counter-Free Automata, M.I, 1970.

D. Perrin, Symbolic dynamics and finite automata, Proc. MFCS'95, 1995.
DOI : 10.1007/3-540-60246-1_116

URL : https://hal.archives-ouvertes.fr/hal-00620643