0 votes 0 votes closed as a duplicate of: Which of the following languages are Recursively Enumerable language? Which of the following language is decidable? a. {(M)| M is a TM and there exist an input whose length is less than 100, on which M halts} b. {(M)| M is a TM and L(M) = {00, 11}} c. Both (a) and (b) d. None of the above Theory of Computation decidability theory-of-computation + – saurabh rai asked Oct 25, 2016 closed Oct 25, 2016 by Prashant. saurabh rai 451 views comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments monty commented Oct 25, 2016 reply Follow Share @arjun sir both are not decidable . using Monotonic property 0 votes 0 votes Anusha Motamarri commented Oct 25, 2016 reply Follow Share yes my mistake.both are undecidable 2 votes 2 votes saurabh rai commented Oct 25, 2016 reply Follow Share ans given is also wrong ie option a and they provided a video solution for this .... so embarrassing 0 votes 0 votes Please log in or register to add a comment.