Question: Question 7 When using the pumping lemma with length to prove that the language L = {bab, n>0} is nonregular, the following approach is taken.

 Question 7 When using the pumping lemma with length to prove

Question 7 When using the pumping lemma with length to prove that the language L = {ba"b, n>0} is nonregular, the following approach is taken. Assume L is regular. Then there exists an FA with k states which accepts L. We choose a word w = bakb = xyz, which is a word in L. Some options for choosing xyz exist. A. X = 4, y = b, z = akb B. x = b, y = a, z = ak-pb, for some p > 0, p 0, p+q

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!