Recursively enumerable languages are not closed under ______________
(a) Union
(b) Intersection
(c) Complementation
(d) Concatenation
I have been asked this question in an international level competition.
The query is from Context Free Grammar topic in portion Contextfree Grammar and Syntax Analysis of Compiler