Name: ____________________________________________________ Alpha: _____________________

Describe help received: _________________________________________________________________

Consider the grammar G given by

S → ABA
A → aa | bb | aBb
B → cAc | cc

Problem 1

From the Pumping Lemma for Context Free Languages given in the class notes, what length for a string u would suffice to gauruntee that u could be "pumped", i.e. that we could find repeated symbols, break up into v,w,x,y,z, etc?
 

Problem 2

Now consider the very much shorter string u = bbcaccbcaccb.