Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
The language L = {ai b ci | i ≥ 0} over the alphabet {a, b, c} is :
1
a regular language
2
not a deterministic context free language but a context free language
3
recursive and is a deterministic context free language
4
not recursive