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 languages :
L1 = {am bn | m ≠ n}
L2 = {am bn | m = 2n + 1}
L3 = {am bn | m ≠ 2n}
Which one of the following statement is correct ?
1
Only L1 and L2 are context free languages
2
Only L1 and L3 are context free languages
3
Only L2 and L3 are context free languages
4
L1, L2 and L3 are context free languages