Question: This question is about CFG (Context free language). Given a language L = {a i+j b j+k c k+i | i, j, k >= 0}
This question is about CFG (Context free language). Given a language L = {ai+jbj+kck+i | i, j, k >= 0} on alphabets {a, b, c} as CFG (context free language). Then is the language L1 = {ai+jbj+kck+ldi+l | i, j, k, l >= 0} on alphabet {a, b, c, d} context free too? If yes please derive its full context-free grammar. If no prove its non context-free property by pumping lemma (demon's game format). Thank you!
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
