Ace Test Series: Theory of Computation - Turing Machine

Question

Comments

A is ans.?

---

They have given (D) as the answer.

I just want to know what is the intersection of (REL but not REC) and (not REL) ?

I think we can't say anything about it but accoring to them it is REL. btw I also marked the answer as (a) :(

Answer 1

I think they missed 'not' in option (D).

And, we can do it by another method also, intersection of the above two mentioned language would be nothing but L = {M | M accepts exactly 2016 strings} and using Rice's theorem 1 and 2 we can say it is NOT REL.