Question: 6. For each part, show that the language is context-free, or use the pumping lemma to show that the language is non-context-free. You must justify

6. For each part, show that the language is context-free, or use the pumping lemma to show that the language is non-context-free. You must justify your answers to receive full credit. 20 points a) L, = {wxlw,x {0,1}* and w contains the substring x} b) 40 = {a'b'cli z j and i sk and jsk, where i, j,k 20}
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
