Question

Turing machine! Y u no move left? In this problem, you will examine two

Turing machine variants. There is no need to provide a formal (low-level)

description of any Turing machines you construct; high-level descriptions

will suffice.

a. A Turing machine with left-reset intsead of left is defined as a Turing

machine that, rather than moving either left or right at each step, can

either move its head one space to the right or jump all the way to the

start of the tape (on the left). Show that such a Turing machine can

simulate a regular Turing machine and show the other direction as well.

b. A Turing machine with stay-put instead of left is defined as a Turing

machine that, rather than moving either left or right at each step, can

either move its head one space to the right or not move at all. Prove that

these machines can only recognize regular languages.​

Answer 1

Answer:

what can I answer????????????????