Download presentation
Presentation is loading. Please wait.
1
Princeton University COS 226 Algorithms and Data Structures Spring 2004 Kevin Wayne http://www.Princeton.EDU/~cos226 DFA Simulation in KMP
2
2 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
3
3 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
4
4 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
5
5 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
6
6 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
7
7 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
8
8 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
9
9 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
10
10 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
11
11 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
12
12 DFA Simulation in KMP 34 aa 56 a 01 aa 2 b b b b b b a aabaaa Search Pattern aaabaa Search Text baaab accept state
Similar presentations
![Cs466(Prasad)L13DFAMin1 DFA Minimization. cs466(Prasad)L13DFAMin2 Strings over {a,b} with even number of a’s ** EaOa EbOb Eb b b b b aa a a [Oa,Ob]](/11/3302985/big_thumb.jpg "Cs466(Prasad)L13DFAMin1 DFA Minimization. cs466(Prasad)L13DFAMin2 Strings over {a,b} with even number of a’s ** EaOa EbOb Eb b b b b aa a a [Oa,Ob]>")
![Knuth-Morris-Pratt KMP algorithm. [over binary alphabet] n Build DFA from pattern. n Run DFA on text. 34 aa 56 a 01 aa 2 b b b b b b a aabaaa aaabaa Search.](/16/4901553/big_thumb.jpg "Knuth-Morris-Pratt KMP algorithm. [over binary alphabet] n Build DFA from pattern. n Run DFA on text. 34 aa 56 a 01 aa 2 b b b b b b a aabaaa aaabaa Search.>")
