Recursively enumerable languages are closed under intersection (run both machines), but not under complementation. Recursive languages are a subset of r.e. languages, not the other way round, and the set of r.e. languages is countable.
More Turing Machines and Undecidability questions
GATE 2018 CS Q46– Consider the following problems. L(G) denotes the language generated by a grammar G. L(M)…
GATE 2015 CS (CS1) Q28– For any two languages L 1 and L 2 such that L 1 is context-free and L 2 is recursively…
GATE 2016 CS (CS1) Q27– Which of the following decision problems are undecidable? I. Given NFAs N 1 and N 2, is…
GATE 2016 CS (CS1) Q54– Let X be a recursive language and Y be a recursively enumerable but not recursive…
GATE 2017 CS (CS1) Q49– Let A and B be finite alphabets and let \# be a symbol outside both A and B. Let f be a…
GATE 2014 CS (CS1) Q45– Let L be a language and L its complement. Which is NOT a viable possibility?