3.

We prove that L3 = {1n2

n = 0} is not regular.

We show that the pumping lemma does not hold for L3. Consider any pumping number p = 1. Choose w = 1p2. Consider any pumping decomposition w = xyz such that y > 0 and xy = p. It fo llows that x = 1a and y = 1b and z = 1p2 -a-b, for b = 1 and a + b = p. Choose i = 2. We need to show that xy2z = 1n2+b is not in L3; that is, we need to show that p2 + b is not a square. Since b = 1, we have p2 + b > p2. Since a + b = p, we have p2 + b = p2 + p < (p + 1)2 4.Prove that La nguage L = {0n: n is a perfect square} is irregular. Solution: L is infinite. Suppose L is also regular. Then according to pumping le mma there exists an integer n such that for every string w in where w >= n, we can break w into three strings w = xyz such that: y > 0 , xy <= n and for all k>=0 , the string xykz is also in L. Choose w to be w = 0s where s = n2 that is it is a perfect square. Let w= 00000000000000000 00000 = xyz . (The length of w = s = n2 in this case.) Let xy <= n and y = k. That is w = 0000 0k 000 X y z So, xyz = xz + y = (n2- k ) + (k) From pumping lemma, I can pump y any number of times and the new string should also belong to the language. Suppose I pump y twice then, the new string should belong to the language that is it should have length that is a pe rfect square but, xy2z = xz + 2 y = (n2- k ) + 2k = n2 + k where n2 + k < 1 =" (n+1)(n+1)"> n2 (As k > 0) => n2 <>2 + k < (n+1)2 => n2 + k is not a perfect square => xy2z is not in L => This is a contradiction to the pumping lemma So, our initial assumption must have been wrong that is L is not regular.