1 / 12

Knuth-Morris-Pratt

Learn the Knuth-Morris-Pratt (KMP) algorithm over a binary alphabet. Build a Deterministic Finite Automaton (DFA) from a pattern and run the DFA on text for fast substring search. Follow step-by-step examples. Master the accept state to optimize performance.

todd-boone
Download Presentation

Knuth-Morris-Pratt

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  2. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  3. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  4. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  5. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  6. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  7. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  8. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a a a b a a a a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  9. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a a a b a a a a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  10. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a a a b a a a a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  11. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a a a b a a a a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

  12. Knuth-Morris-Pratt • KMP algorithm. [over binary alphabet] • Build DFA from pattern. • Run DFA on text. Search Text a a a b a a b a a a b a a b a a a a a b a a a a a b a a a b a a a a a b a b 0 1 3 4 2 5 6 accept state b b b

More Related