Question:

If L and L are recursively enumerable, then L is:

Show Hint

To determine whether a language is recursive, check if both the language and its complement are recursively enumerable.
Updated On: Dec 29, 2024
  • Regular
  • Context-free
  • Context-sensitive
  • Recursive
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Solution and Explanation

If both L and L are recursively enumerable (RE), then L must be recursive. This is because a language L is recursive if both L and its complement L are RE. In other words, if you can enumerate both a language and its complement, you can decide membership in the language, meaning it is recursive.
Was this answer helpful?
0
0

Questions Asked in CUET PG exam

View More Questions