Question:medium

If a language $L$ and its complement $L'$ are both Recursively Enumerable (RE), then $L$ is:

Show Hint

Complement Laws: The class of Recursive languages is closed under complementation, but the class of Recursively Enumerable (RE) languages is NOT.
Updated On: Jul 4, 2026
  • Context-sensitive
  • Recursive
  • Not accepted by any Turing Machine
  • Universal
Show Solution

The Correct Option is B

Solution and Explanation

Was this answer helpful?
0

Top Questions on Context Free Languages and Pushdown Automata

Questions Asked in AP PGECET exam