Question: Exercise 1 (25 points). Let L be the language on the alphabet {0, 1, #} defined as follows, L= {w#w2##wmm>2, cach w, E {0,
Exercise 1 (25 points). Let L be the language on the alphabet {0, 1, #} defined as follows, L= {w#w2##wmm>2, cach w, E {0, 1}", and w, w, for some i j}. Use the pumping lemma for context-free languages to show that L is not context- free.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
