2 votes 2 votes Consider the following langauge over Σ = {0, 1}: L = {<M>|M is TM that accept all strings of length atmost 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-machine made-easy-test-series + – ashish pal asked Jan 22, 2018 • edited Mar 5, 2019 by ajaysoni1924 ashish pal 476 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply shriram s 1 commented Jan 22, 2018 reply Follow Share I think option C. Check out the second question in the below link. https://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf 0 votes 0 votes ashish pal commented Jan 22, 2018 reply Follow Share yes answer is C 0 votes 0 votes Mizuki commented Dec 3, 2018 reply Follow Share Why is it not option B? @shriram s 1 @ashish pal 0 votes 0 votes Please log in or register to add a comment.
