[8a-2] The Pumping Theorem for CFLs - Example (COMP2270 2017)
We use the non context free language A^nB^nC^n as an example to show how the pumping theorem for CFLs can be used to prove that a language is not context free.
We use the non context free language A^nB^nC^n as an example to show how the pumping theorem for CFLs can be used to prove that a language is not context free.