The Pumping Lemma is not used to explain something is regular. It is used to show that for a given non-regular language, a DFA cannot exist. Do you now see that to claim that “no DFA can exist,” one must rule out all such x, y, z based on some initial string s of length at least N?Why can’t we pick x, y, z according to our convenience? Answer in 2-3 clear sentences.
I have explained with an example so see the image below
##for any queries do comment below feel free to ask for queries
Get Answers For Free
Most questions answered within 1 hours.