Exercise 1. Use the pumping lemma to show that the following languages are not context free. 3·(w#tl t is a substring of w, where to, t E {0, 1)’). 4. {tı #t2# . . . #tel k > 2, each ti E {0, 1)’ and ti = tj for some J} 5. The set of palindronnes over {0,1} containing an equal number of 0s and 1s Show transcribed image text Exercise 1. Use
OR
OR