0 votes 0 votes By reading any string, which of the following is possible for a Turing Machine? TM halts in Final State TM halts in Non Final State TM enters into Infinite Loop All of these Theory of Computation tbb-toc-1 + – Bikram asked Nov 26, 2016 edited Aug 20, 2019 by Counsellor Bikram 164 views answer comment Share Follow See 1 comment See all 1 1 comment reply Hira Thakur commented Jan 4, 2018 reply Follow Share option D is correct?? by reading any string TM can go either final halt, NF halt, or may go infinite loop 0 votes 0 votes Please log in or register to add a comment.