C. Allauzen, M. Crochemore, and M. Raffinot, Factor oracle: a new structure for pattern matching, SOFSEM'99: theory and practice of informatics (Milovy, Lecture Notes in Comput. Sci. 1725, pp.295-310, 1999.

C. Allauzen, M. Crochemore, and M. Raffinot, Efficient Experimental String Matching by Weak Factor Recognition*, Lecture Notes in Comput. Sci. 2089, pp.51-72, 2001.
DOI : 10.1007/3-540-48194-X_5
URL : https://hal.archives-ouvertes.fr/hal-00619845

G. Assayag and S. Dubnov, Using Factor Oracles for Machine Improvisation, Soft Computing, vol.8, issue.9, pp.604-610, 2004.
DOI : 10.1007/s00500-004-0385-4
URL : https://hal.archives-ouvertes.fr/hal-01161221

A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, 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

L. Cleophas, G. Zwaan, and B. Watson, Constructing factor oracles, J. Autom . Lang. Comb

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 and C. Hancart, Pattern matching automata, Handbook of Formal Languages, pp.399-461, 1997.
DOI : 10.1017/CBO9780511546853.003

M. Crochemore, L. Ilie, and E. Seid-hilmi, Factor Oracles, Proc. of CIAA'06, pp.78-89, 2006.
DOI : 10.1007/11812128_9
URL : https://hal.archives-ouvertes.fr/hal-00619980

R. Kato and O. Watanabe, Substring search and repeat search using factor oracles, Information Processing Letters, vol.93, issue.6, pp.269-274, 2005.
DOI : 10.1016/j.ipl.2004.11.011

A. Lefebvre and T. Lecroq, Compror: On-line lossless data compression with a factor oracle, Information Processing Letters, vol.83, issue.1, pp.1-6, 2002.
DOI : 10.1016/S0020-0190(01)00308-8

A. Lefebvre and T. Lecroq, A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences, International Journal of Computer Mathematics, vol.12, issue.12, pp.1303-1315, 2002.
DOI : 10.1109/TIT.1978.1055934

A. Lefebvre, T. Lecroq, and J. Alexandre, An improved algorithm for finding longest repeats with a modified factor oracle, J. Autom. Lang. Comb, vol.8, issue.4, pp.647-657, 2003.

A. Mancheron and C. Moan, COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES, International Journal of Foundations of Computer Science, vol.16, issue.06, pp.1179-1191, 2005.
DOI : 10.1142/S0129054105003741
URL : https://hal.archives-ouvertes.fr/hal-00487228

E. Ukkonen, Constructing suffix trees on-line in linear time, Proc. Information Processing'92, pp.484-492, 1992.