0 votes 0 votes Consider the following equation: L1:{TM IT M accepts Є} L2:{TM IT M accepts only Є} Which of the following is not semidecidable? SELECT ONE OPTION A L1 only B L2 only C Both L1 and L2 D none of the above Theory of Computation theory-of-computation non-gate + – AyanDutta asked May 8, 2023 AyanDutta 274 views answer comment Share Follow See 1 comment See all 1 1 comment reply DEEPAL123 commented May 12, 2023 reply Follow Share I think answer should be l2 only.Since it only becomes rel and thus semidecidable. 0 votes 0 votes Please log in or register to add a comment.