Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Consider the following language:
L1 = {an+m bn am | n, m ≥ 0}
L2 = {an+m bn+m an+m |n, m ≥ 0}
Which one of the following is correct?1
Only L1 is Context Free Language
2
Both L1 and L2 are not Context Free Language
3
Only L2 is Context Free Language
4
Both L1 and L2 are Context Free Language