Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Consider the following statements with respect to the language L = {anbn |n≥ 0}
S1 : L2 is context free language
S2 : Lk is context-free language for any given k ≥ 1
S3 : L̅ and L* are context free languages
Which one of the following is correct?
1
only S1 and S2
2
only S1 and S3
3
only S2 and S3
4
S1, S2 and S3