Explain in detail please. 1. [10 points] Let M = {aibici > 0}. Use the Pumping Lemma

Explain in detail please.

 

Transcribed Image Text:

1. [10 points] Let M = {aibici > 0}. Use the Pumping Lemma for Context-Free Languages to prove that L is not Context-Free. 2. [10 points] Let L= {abcdi, j>0}. Use the Pumping Lemma for Context-Free Languages to prove that L is not Context-Free. 3. [10 points] Let K = {w E {a, b, c}*w has equal numbers of a's, b's, and c's}. Use the Pumping Lemma for Context-Free Languages to prove that K is not Context-Free. 4. [10 points] Let J = {010110 < i 1. [10 points] Let M = {aibici > 0}. Use the Pumping Lemma for Context-Free Languages to prove that L is not Context-Free. 2. [10 points] Let L= {abcdi, j>0}. Use the Pumping Lemma for Context-Free Languages to prove that L is not Context-Free. 3. [10 points] Let K = {w E {a, b, c}*w has equal numbers of a's, b's, and c's}. Use the Pumping Lemma for Context-Free Languages to prove that K is not Context-Free. 4. [10 points] Let J = {010110 < i