Question: Using the pumping lemma for CFLs, show that the following language is not context free: { 0^i 1^j 2^k | i < k and j
Using the pumping lemma for CFLs, show that the following language is not context free:
{ 0^i 1^j 2^k | i < k and j < k }
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
