II. String-matching automata (50 points) Given the following string text: Petri wrote Petri net. Given a pattern: Petri
Posted: Thu May 05, 2022 12:59 pm
II. String-matching automata (50 points) Given the following string text: Petri wrote Petri net. Given a pattern: Petri net 4. (10 points) Apply the brute-force string matching algorithm to determine whether it is occurred in the given string text. How many times of comparison between the contents of the pattern and the text do you need to have? (You need to show the number of comparisons you have claimed.)