0 0 votes Consider the following language: L = {<M>|M halts after 200 steps for all inputs} Which of the following is True about L? A.L is decidable B.L is undecidable C.Cannot be predicted D.None of the above Theory of Computation identify-class-language recursive-and-recursively-enumerable-languages + – Rajender gill 1.3k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes Option c. The type of M is not provided, if it was a FA/PDA then it would have been decidable but if it was a TM then it would be undecidable. So as M is not provided we can’t predict the behavior. Sunnidhya Roy answered Dec 21, 2022 Sunnidhya Roy comment Share Follow See all 11 Comments 11 11 Comments reply Show 8 previous comments Rajender gill commented Dec 22, 2022 reply Follow flag means answer should be UNDECIDABLE 0 0 replyShare Sunnidhya Roy commented Dec 22, 2022 reply Follow flag @Rajender gill the type of M is not given so we can’t predict if its decidable or undecidable. If M is a TM then it will be undecidable but if it is a FA/PDA then it will be decidable. 0 0 replyShare Rajender gill commented Dec 22, 2022 reply Follow flag Thank you. 0 0 replyShare Please log in or register to add a comment.
