Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) Recursively enumerable languages are not closed under

(A) Union
(B) homomorphism
(C) complementation
(D) concatenation
Correct answer : Option (C) - complementation

Share

Discusssion

Login to discuss.