reshown by
1,067 views
0 votes
0 votes

When trying to prove a language L is not regular 

  1. assuming that L is regular
  2. there exist a pumping length let's say m for L and $\left | m \right | \geq 1$
  3. w = xyiz where i = 0,1,2,3,4,..... and w $\in L$

now every time i get confused what should be m and what should be y both are unknown so how to proceed with proof?

also i want to ask that is approach for every proof is different? like in this video(2:40) she took i = p+1 but why she did that ? like how one should know it must be p+1? i want someone to generalize the pumping lemma proofs 

reshown by

1 Answer

Best answer
3 votes
3 votes

Well, basically we do not take any "m" as pumping length but just assumes "m" as some integer value which is supposed to be existing (if pumping lemma is violated no such $m$ will exist). Our only aim is to prove that some $w$ given by $xy^iz$ is not in $L$ which would make the language irregular.

So, we should find an appropriate "i" and also the split $x,y,z.$ Here, finding "i" is like a puzzle and I do not think there exist any systematic way which works for all languages. For example,

  1. $L = \{0^{n^2}\mid n \geq 0\},$ Taking $w = 0^{m^2}$ where $m$ is the pumping length so that the string length is greater than or equal to the pumping length as mandated by pumping lemma. $0^{m^2}= xyz \text{ or }0^X0^Y0^Z.$ Now, pumping lemma condition says that for "SOME" $\mid xy\mid < m, \mid y \mid >0, xy^iz \in L, \forall i \geq 0$. 
  2. Now the trick here is that we have to prove "NO SUCH" $x,y,z$ exist such that $xy^iz \in L, \forall i \geq  0.$
  3. So, the split entirely depends on the property of the language. For our $L,$ we need a square number of $0's.$ Our $w = 0^{m^2} = xyz.$ Now without specifying what $x$ and $y$ are, if we can say $xy^iz,i \geq 0,$is not in $L$, then $L$ is irregular. To say this we just need to show for some $i$, $\mid xy^iz \mid$ is not a perfect square. We know that $\mid xyz \mid = m^2$ is a perfect square. Now, by pumping one extra $y$, we increase the string length by $\mid y \mid$. This will be minimum $1$ and maximum $m$ because of the conditions $\mid y \mid > 0$ and $\mid xy \mid \leq m.$ Now, to get the next perfect square after $m^2$ we need to add minimum $2m +1 \because (m+1)^2 = m^2 + 2m+1$, but we are adding maximum $m$ here. So, we proved that for no $x,y,z$ pumping lemma holds thus making the language irregular. Instead of pumping one extra $y$ we could have removed $y$ also (making $i = 0$).

Now, for

  1. $L = \left\{0^p \mid p \text{ is prime}\right\}$, we can take $w = 0^n,$ where $n$ is the first prime number after the pumping length $m$ to satisfy the minimum length condition. Again we do not know what is $m$, but just assuming it exists and has an integer value.
  2. $w = 0^{n} = xyz,\mid xyz \mid = n \text{ is prime}.$ Here we are trying to make $\mid xy^iz \mid$ not a prime number for some $i$. The easiest way is to take $i = n,$ which gives $\mid xy^nz\mid  = n + n \times \mid y\mid = (n+1) \mid y \mid$ which can never be a prime number. So, pumping lemma is violated -- we did not fix any particular $x,y,z$ and showed for all such $x,y,z$ -- and $L$ is irregular.
selected by

Related questions

0 votes
0 votes
1 answer
1
srestha asked Apr 19, 2019
679 views
How by Pumping Lemma we can prove that“context free grammar generate an infinite number of strings”and here what could be pumping length ?
0 votes
0 votes
0 answers
2
jg662 asked Feb 22
97 views
Use the Pumping Lemma to show that the following languages over Σ={�,�}Σ={a,b} are not regular. In each case, carefully describe the string that will be pumped and ...
0 votes
0 votes
1 answer
4
shallowfalcon asked Oct 17, 2022
445 views
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =}How can I prove that L is not a regular language using pumping lemma and contradiction?