< Back to Article
A Memory-Efficient Deterministic Finite Automaton-Based Bit-Split String Matching Scheme Using Pattern Uniqueness in Deep Packet Inspection
Fig 3
Example of DFAs after considering the pattern uniqueness.
(a) DFA for the set of unique patterns; (b) DFA for the set with non-unique patterns.
doi: https://doi.org/10.1371/journal.pone.0126517.g003