Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Which one of the following statements is TRUE for the languages given below?
L1 = { xxR | x ϵ {0,1}*, where xR is the reverse of string x }
L2 = { xx | x ϵ {0, 1}*}
1
L1 is context free but not regular, and L2 is regular.
2
Both L1 and L2 are context free but not regular.
3
L1 is context free but not regular, and L2 is not context free.
4
Both L1 and L2 are not context free.