STRING MATCHING WITH FINITE AUTOMATA

Finite Automata
Example
The Suffix-Function
String-Matching Automata
Finite-Automaton-Matcher
Computing the transition function

$next$ $up$ $previous$
Next: Finite Automata Up: String Matching (14) Previous: Analysis of Boyer-Moore