0 votes 0 votes Let $L$ be a language and $L’$ be its complement. Which one of the following is NOT a viable possibility? Neither $L$ nor $L’$ is RE. One of the $L$ and $L’$ is RE but not recursive;the other is not RE. Both $L$ and $L’$ are RE but not recursive. Both $L$ and $L’$ are recursive. Theory of Computation nielit2017july-scientistb-cs theory-of-computation recursive-and-recursively-enumerable-languages + – admin asked Mar 30, 2020 • retagged Oct 29, 2020 by Krithiga2101 admin 762 views answer comment Share Follow See 1 comment See all 1 1 comment reply sourav. commented Oct 5, 2017 reply Follow Share Option $(C)$ https://gateoverflow.in/1810/gate2014-1-35 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes Answer: C http://www.geeksforgeeks.org/gate-gate-cs-2014-set-1-question-45/ https://gateoverflow.in/1810/gate2014-1-35 mohitbawankar answered Oct 5, 2017 mohitbawankar comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes If both L and L’ are recursively enumerable, then L must be recursive. Hence, both L and L´ are recursively enumerable, but not recursive is not a viable possibility. topper98 answered Mar 19, 2020 topper98 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes option C bcz RE language are not closed under complementation. pritambiswas000007 answered Jun 9, 2020 pritambiswas000007 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes opt a is viable according to the statement. opt b is also viable because if L1 is recursive enumerable then comp(L1) should not be in recursive language and vice versa. opt c is viable recursive enumerable is not closed under complementation. opt d is not viable because recursive holds complementation rule. Answer:opt d keshore muralidharan answered Aug 12, 2020 keshore muralidharan comment Share Follow See all 0 reply Please log in or register to add a comment.