Question

The machine accept the string by entering into hA or it can:

(a) explicitly reject x by entering into hR

(b) enter into an infinte loop

(c) Both (a) and (b)

(d) None of the mentioned

I have been asked this question in semester exam.

My question is from Introduction to Turing Machines topic in chapter Introduction to Turing Machines of Automata Theory

Answer 1

Right option is (c) Both (a) and (b)

Easy explanation: Three things can occur when a string is tested over a turing machine:

a) enter into accept halting state

b) enter into reject halting state

c) goes into loop forever