US Patent:
20120331554, Dec 27, 2012
Inventors:
Rajan Goyal - Saratoga CA, US
Satyanarayan Lakshmipathi Billa - Sunnyvale CA, US
Ken Bullis - Los Altos CA, US
International Classification:
G06F 21/20
Abstract:
A method and corresponding apparatus relate to converting a nondeterministic finite automata (NFA) graph for a given set of patterns to a deterministic finite automata (DFA) graph having a number of states. Each of the DFA states is mapped to one or more states of the NFA graph. A hash value of the one or more states of the NFA graph mapped to each DFA state is computed. A DFA states table correlates each of the number of DFA states to the hash value of the one or more states of the NFA graph for the given pattern.