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

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

Following are some description of TM/algorithm behaviour. Select all that exist.1 pointLoops on all inputsHalts on all inputsDecides HALTSDecides HALTS'Halts on exactly and only the strings in the language HALTSHalts on exactly and only the strings in the language HALTS'

If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is _______

If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is

An FSM can be considered to be a TM1) Of finite tape length, rewinding capability and unidirectional tape movement2) Of finite tape length, without rewinding capability and unidirectional tapemovement3) Of finite tape length, without rewinding capability and bidirectional tapemovement4) Of finite tape length, rewinding capability and bidirectional tape