Finite-Automaton-Matcher

algorithm156

This is clearly O(n) since we take one step for each symbol of T.

So this seems better than the others? Why not use this?


next up previous
Next: Computing the transition function Up: STRING MATCHING WITH FINITE Previous: String-Matching Automata