Assuming the tape is pre-filled with nothing but zeros,how many transitions does this Turing machine take to halt?

Consider the TM where tape alphabet is {a, b, blank} with transitions (q0, a) → (q0, a, R), (q0, blank) → (q0, blank, R), (q0, b) → (qh, b) where qh is a halting state. Select all inputs on which the TM loops.1 pointeaaaaabbbbaba

Which of the functions are not performed by the Turing machine after reading a symbol? ans. moves the tape one cell left/right writes the symbol proceeds with the next instruction or halts none of the mentioned

Which of the functions are not performed by the Turing machine after reading a symbol?ans.moves the tape one cell left/rightnone of the mentionedproceeds with the next instruction or haltswrites the symbol

Which of the functions are not performed by the Turing machine after reading a symbol?ans.none of the mentionedmoves the tape one cell left/rightwrites the symbolproceeds with the next instruction or halts Previous Marked for Review Next

Consider the TM where tape alphabet is {a, b, blank} with transitions (q0, a) → (q0, a, R), (q0, blank) → (q0, blank, R), (q0, b) → (q0, b, R). Select all inputs on which the TM loops.1 pointeaaaaabbbbaba