L1 is the emptiness problem of TM which is undecidable
L2 is halting problem and we know that halting problems are undecidable
NOTE: Emptiness problem is decidable only for Regular languages, CFL and DCFL
but for CSL, REC and RE, it is undecidable.
158 Points
118 Points
65 Points
54 Points
49 Points
46 Points
39 Points
34 Points
31 Points
26 Points