1 votes 1 votes IF L IS DECIDABLE THEN 1)L&L' BE TURING RECOGNIZABLE 2)L MUST BE TURING RECOGNIZABLE BUT L' NEED NOT BE 3)EXACTLY ONE OF L AND L' BE TURING RECOGNIZABLE 4)L' IS TURING RECOGNIZABLE BUT L NEED NOT BE Theory of Computation theory-of-computation decidability + – Himani Srivastava asked Oct 7, 2015 Himani Srivastava 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes L is decidable means it is Recursive language and Recursive language are closed under Complement.So Both L and L' are REC And Recursive language are Turing recognizable . So both L and L' are Turing recognizable Option A Umang Raman answered Oct 7, 2015 Umang Raman comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option A is right option bcz we know that if L is closed under complementation that's why option A will be right option for it. Paras Nath answered Sep 24, 2016 Paras Nath comment Share Follow See all 0 reply Please log in or register to add a comment.