Question: Problem 2 Prove that the following languages are not context - free: L 1 = { a i b j c i d j |

Problem 2
Prove that the following languages are not context-free:
L1={aibjcidj|i1 and {:j1}
L2={x#y|x is a substring of y, where {:x,yin{a,b}*}
Please help me with the two parts. using th epumping lemma for context free languages for a contradiction might be helpful. Promise to thumb up!
Problem 2 Prove that the following languages are

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!