0 votes 0 votes Consider the following language: L = {< M > | L(M) has atleast 10 strings} Which of the following is true about L? A.L is decidable B.L is Turing recognizable C.L is not recursive D.None of these Theory of Computation identify-class-language recursive-and-recursively-enumerable-languages + – Rajender gill asked Dec 21, 2022 edited Dec 21, 2022 by gatecse Rajender gill 457 views answer comment Share Follow See all 18 Comments See all 18 18 Comments reply Show 15 previous comments raja11sep commented Dec 21, 2022 reply Follow Share ok 0 votes 0 votes gatecse commented Dec 21, 2022 reply Follow Share Meanwhile answer to this is B;C whether it be MCQ or MSQ or whatever type. 0 votes 0 votes raja11sep commented Dec 21, 2022 reply Follow Share Yes sir. 0 votes 0 votes Please log in or register to add a comment.