1 votes 1 votes Theory of Computation turing-machine + – Sunil8860 asked Sep 4, 2017 Sunil8860 235 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Warlock lord commented Sep 4, 2017 reply Follow Share I think a is true. Am I right? 0 votes 0 votes sachin! commented Sep 4, 2017 reply Follow Share both are not r.e 0 votes 0 votes amrendra pal commented Sep 7, 2017 reply Follow Share answer should be (c), because, L(M) will be a decidable language . and a language L is said to be decidable iff L and L' both are turing recognizable(recursive enumerable.) 0 votes 0 votes Please log in or register to add a comment.