0 votes 0 votes Which of the following statements is FALSE? Recursive Enumerable Languages are not closed under set difference and complementation. Complement of context-free language must be recursive. If a problem $X$ is NP complete and $X \in P,$ then $NP = P$. Membership problem is not decidable for Recursive Languages. Theory of Computation tbb-toc-2 theory-of-computation closure-property p-np-npc-nph + – Bikram asked Aug 12, 2017 • retagged Sep 17, 2020 by ajaysoni1924 Bikram 440 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Membership problem is decidable under recursive languages. Turing machine for recursive language will either accept the given input string or it will reject the input string, so statement is false. Bikram answered Aug 12, 2017 • selected Aug 17, 2019 by Bikram Bikram comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Bikram commented Aug 24, 2017 reply Follow Share @ Vasu Srivastava and @ ashoklb Complement of context - free language must be recursive This is correct statement. see the answer here https://gateoverflow.in/6370/complement-contet-language-recursive-recursive-enumerable it describes why every CFL is RE .. 2 votes 2 votes ashoklb commented Aug 24, 2017 reply Follow Share Got it. Thank u sir. 0 votes 0 votes logan1x commented Dec 3, 2019 reply Follow Share Any source to look for option C? 0 votes 0 votes Please log in or register to add a comment.
