Question: Prove that the language L = { ( a n b n ) n | n 1 } is not a context - free language.
Prove that the language is not a contextfree language. Note that you have to give a formal proof.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
