C. Allauzen, M. Crochemore, and M. Raanot, Factor oracle, Suux oracle, 1999.

C. Allauzen and M. Raanot, Oracle des facteurs d'un ensemble de mots Rapport technique 99-11, 1999.

R. A. Baeza-yates, Searching subsequences, Theoretical Computer Science, vol.78, issue.2, pp.363-376, 1991.
DOI : 10.1016/0304-3975(91)90358-9
URL : http://doi.org/10.1016/0304-3975(91)90358-9

A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M. T. Chen et al., The smallest automation recognizing the subwords of a text, Theoretical Computer Science, vol.40, issue.1, pp.31-55, 1985.
DOI : 10.1016/0304-3975(85)90157-4

A. Blumer, A. Ehrenfeucht, and D. Haussler, Average sizes of suffix trees and DAWGs, Discrete Applied Mathematics, vol.24, issue.1-3, pp.37-45, 1989.
DOI : 10.1016/0166-218X(92)90270-K

R. S. Boyer and J. S. Moore, A fast string searching algorithm, Communications of the ACM, vol.20, issue.10, pp.762-772, 1977.
DOI : 10.1145/359842.359859

M. Crochemore, Transducers and repetitions, Theoretical Computer Science, vol.45, issue.1, pp.63-86, 1986.
DOI : 10.1016/0304-3975(86)90041-1
URL : https://hal.archives-ouvertes.fr/hal-00619540

M. Crochemore, F. Mignosi, and A. Restivo, Automata and forbidden words, Information Processing Letters, vol.67, issue.3, pp.111-117, 1998.
DOI : 10.1016/S0020-0190(98)00104-5
URL : https://hal.archives-ouvertes.fr/hal-00619578

M. Crochemore, F. Mignosi, and A. Restivo, Minimal forbidden words and factor automata, number 1450 in LNCS, 1998.
DOI : 10.1007/BFb0055817
URL : https://hal.archives-ouvertes.fr/hal-00619990

M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi, Text compression using antidictonaries, 1998.
DOI : 10.1007/3-540-48523-6_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8077

M. Crochemore and W. Rytter, Text algorithms, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00619796

M. Crochemore and R. Erin, Direct construction of compact directed acyclic word graphs, Combinatorial Pattern Matching, number 1264 in LNCS, pp.116-129, 1997.
DOI : 10.1007/3-540-63220-4_55
URL : https://hal.archives-ouvertes.fr/hal-00620006

M. Crochemore and R. Erin, On compact directed acyclic word graphs, Structures in Logic and Computer Science, number 1261 in LNCS, pp.192-211, 1997.
DOI : 10.1007/3-540-63246-8_12
URL : https://hal.archives-ouvertes.fr/hal-00620801

A. Czumaj, M. Crochemore, L. Gasieniec, S. Jarominek, T. Lecroq et al., Speeding up two string-matching algorithms, Algorithmica, vol.12, pp.247-267, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00619553

D. Sunday, A very fast substring search algorithm, Communications of the ACM, vol.33, issue.8, pp.132-142, 1990.
DOI : 10.1145/79173.79184