A hybrid multiple-character transition finite-automaton for string matching engine
A hybrid finite automaton is proposed with deterministic and nondeterministic parts. The hybrid FA is capable of inspecting multiple characters in parallel. The space required by the finite automata is efficient when scales up. The transitions number increases almost linearly to the number of multi-character. A configurable multi-stage architecture can implement the hybrid finite automaton.
string matching deterministic and nondeterministic finite automaton aho-corasick algorithm network intrusion detection system