Question: (10pts) Given a DFA, M, with alphabet, , and a string s = 818283... $100 that is in L(M). Prove that if the number of

(10pts) Given a DFA, M, with alphabet, , and a string s = 818283... $100 that is in L(M). Prove that if the number of states in M is 10, then there must be a substring between $45 and 865 that can be repeated an arbitrary number of times and the so modified string will still be in L(M)
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
