CSE 460

Homework 4: Pumping Lemma

Due: Tuesday, November 6, 2012
Some basic things I will be looking for in grading your answers
for the following questions on Pumping Lemma:
Correct use of decomposition of x.
Correct choice of k.
Clear argument that your choice of k leads to uvkw being
a string that is not in the language.
1. Consider the following language L:
L={x | x(a, b) and x contains equal number of as and
bs}
Thus, abaababbL and aaabbbL but aabbbL
Apply Pumping Lemma to show that L is not regular. You
have the following two choices of x and apply both choices of
x to prove that the language is not regular. If you cannot
prove for a choice of x given, you have to show why you
cannot prove it for that choice of x. Assume n to be the
integer from the Puming Lemma.
(a) (10 points)
x = ak bk | k = n/2}
(b) (10 points)
x = ak bk | k = n}

2. (10 points)
Show that the language L as defined below is not regular
by using the Pumping Lemma.
L={xxr | x{0, 1}n and xr is the reverse of x. }
For axample if x=010001 then xr =100010
These strings are called even length palindromes.