Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Which of the following are correct on regular expressions?
A. φ + L = L + φ = L
B. εL = Lε = L
C. φL = Lφ = φ
D. φL = Lφ = L
Choose the correct answer from the options given below:
1
A, B and D only
2
A, B and C only
3
B and D only
4
A and D only