Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Consider the language \(L = \left\{ {{a^n}{b^{n - 3}}\ | n > 2} \right\}\) on ∑ = {a, b}. Which one of the following grammars generates the language L?
1
S → aA|a, A → aAb|b
2
S → aaA|λ, A → aAb|λ
3
S → aaaA|a, A → aAb|λ
4
S → aaaA, A → aAb|λ