4 votes 4 votes Consider the following language over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length at most 5} Which of the following is true? (A) Decidable and REC (B) Undecidable and RE (C) Undecidable and non RE (D) Decidable but RE Theory of Computation theory-of-computation turing-machines decidability madeeasy-testseries-2018 + – Bhavya Bhatia asked Jan 11, 2018 • edited Mar 5, 2019 by ajaysoni1924 Bhavya Bhatia 2.4k views answer comment Share Follow See all 17 Comments See all 17 17 Comments reply Show 14 previous comments TUSHAR_BHATT commented Jan 17, 2020 reply Follow Share Okay I was confused because of "atmost" now clear :) 0 votes 0 votes LakhanMalviya commented Jan 24, 2020 reply Follow Share the answer right by rice theorem 0 votes 0 votes roh commented Jul 16, 2020 reply Follow Share If the above language is NOT RE, then how the below https://gateoverflow.in/151057/langle-rangle-there-exist-input-whose-length-than-which-halts%24 is RE? Please clarify. 0 votes 0 votes Please log in or register to add a comment.