Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
If L1 and L2 are context free languages, which of the following is True about L1 ∩ L2 ?
1
L1 ∩ L2 is context free
2
L1 ∩ L2 is Regular
3
L1 ∩ L2 is Recursively Enumerable
4
L1 ∩ L2 is Context Sensitive