Question: 14.14 Explain what is wrong with the following proof that the language L of the RE a b is nonregular. Suppose L were regular. Then
14.14 Explain what is wrong with the following "proof" that the language L of the RE a b" is nonregular. Suppose L were regular. Then it would be accepted by a DFA with, say, k states. Consider the string z-1k. Split z = uvw with u = 01, Then uu2w is not in L. This is a contradiction of the Pumping Lemma, and so our supposition is false
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
