Question: Using pumping Lemma, prove that following languages are not a CFL (a) L = {a n b n c n | n > 0}
Using pumping Lemma, prove that following languages are not a CFL (a) L = {an bn cn | n > 0}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
