Factor Oracle, Suffix Oracle

代码说明：

We introduce a new automaton on a word p, sequence of letters taken in an alphabet ,that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p , has m 1 states and a linear number of transitions . We give an on-line construction algorithm of the factor oracle. The tight links between this structure and the suffix automaton allows us to introduce a second structure : the suffix oracle . We use these two structures in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as efficient as the ones that already exist using less memory and being more easy to implement.