Below is a faulty proof that L ab is not regular Play the r
Solution
In pumping lemma for regular languages , , Let L be a regular language. Then there exists a constant ‘c’ such that for every string w in L
|w| c
We can break w into three strings, w = xyz, such that
In your proof , you must have taken x and y values as strings of \"a\" andz as a combination of a and b . and retry the proof so that you can proove that L is not regular since it has to be of the form a^nb^n
At first, we have to assume that L is regular.
So, the pumping lemma should hold for L.
Use the pumping lemma to obtain a contradiction
Select w such that |w| c
Select y such that |y| 1
Select x such that |xy| c
Assign the remaining string to z.
Select k such that the resulting string is not in L.
|w| = 2n n.
By pumping lemma, let w = xyz, where |xy| n.
Let x = ap, y = aq, and z = arbn, where p + q + r = n.p 0, q 0, r 0. Thus |y| 0
Let k = 2. Then xy2z = apa2qarbn.
Number of a s = (p + 2q + r) = (p + q + r) + q = n + q
Hence, xy2z = an+q bn. Since q 0, xy2z is not of the form anbn.
Thus, xy2z is not in L. Hence L is not regular.
