Which of the following cannot be a possibility of a TM while it processes an input?
(a) Enters accepting state
(b) Enters non-accepting state
(c) Enters infinite loop and never halts
(d) None of the mentioned
The question was asked in a national level competition.
Question is taken from Non Deterministic Turing Machines topic in division Introduction to Turing Machines of Automata Theory