PROBLEM SET 5

Give the KMP FSA for the string 10011001000.



How many bits are tested by the right-left pattern scan method when searching for 5 consecutive 1s in the string 11011010100011110110111011111?



Draw an FSA that will efficiently recognize one of the set of patterns 00000, 1010, 111, and 001 in a given binary text string.



Due: Wednesday, March 27.