There exist a recursive enumerable language whose __________ is not…
2025
There exist a recursive enumerable language whose __________ is not recursively enumerable.
- A.
Union
- B.
Intersection
- C.
Complementation
- D.
Concatenation
Attempted by 6 students.
Show answer & explanation
Correct answer: C
Recursive enumerable languages are closed under union, intersection, and concatenation. However, they are not closed under complementation. If a language is RE but not recursive, its complement is not recursively enumerable.