Theory of Computation2080.15 marksPumping Lemma for CFL
Prove that th language is not a context free grammar. L = an bn cn mid n geq 0
Prove that th language is not a context free grammar. $L = {a^n b^n c^n \mid n \geq 0}$ [5]
--- If A is a Context Free Language, then A has a pumping length P such that any string s where s ≥ P may be divided into 5 pieces s = uvxyz satisfying: 1. uv^i xy^i z ∈ A for every i ≥ 0 2. vy 0 (v and y are not both empty) 3. vxy ≤ P --- Assume L is Context Free. Then by the Pumping Lemma, L mu...