Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Which of the following statement is correct?
1
Ackermann's function is primitive recursive.
2
L= {anbkcn+k : n ≥ 0, k ≥ 0} is regular language.
3
L = {anbj : n = J2} is not context free language
4
For every context sensitive language L not including λ, there exists some linear bounded automata M such that L ≠ L(M).