Consider the following Language:
L= $a^{n}b^{n}c^{n}$ | $n \geq 0$
Consider the following Statement:
- A PDA can accept the given language. As we can insert 2 a’s for every entry of a, and pop one ‘a’ for every b and after all b’s, pop one ‘a’ for every entry of ‘c’
So the above language is a CFL.
Prove the above statement WRONG