URGENT!
Posted: Fri Apr 29, 2022 6:33 am
URGENT!
Q1. String Matching [15 points) Construct the string-matching finite automata for the patterns P = abbcaba and P2 = 010110. Then, determine the shifts (starting from index 0) at which each pattern occurs in the text strings T1 = ababbaabbcabaabbcabba and Tz 001011010101101, respectively. DO NOT show the transitions to the starting states.
- Urgent 1 (17.73 KiB) Viewed 21 times
- Urgent 2 (17.73 KiB) Viewed 21 times