Read-only Turing Machine - Theory

Theory

We define a standard Turing machine by the 9-tuple

where

• is a finite set of states;
• is the finite set of the input alphabet;
• is the finite tape alphabet;
• is the left endmarker;
• is the blank symbol;
• is the transition function;
• is the start state;
• is the accept state;
• is the reject state.

So given initial state reading symbol, we have a transition defined by which replaces with, transitions to state, and moves the "read head" in direction (left or right) to read the next input. In our 2DFA read-only machine, however, always.

This model is now equivalent to a DFA. The proof involves building a table which lists the result of backtracking with the control in any given state; at the start of the computation, this is simply the result of trying to move past the left endmarker in that state. On each rightward move, the table can be updated using the old table values and the character that was in the previous cell. Since the original head-control had some fixed number of states, and there is a fixed number of states in the tape alphabet, the table has fixed size, and can therefore be computed by another finite state machine. This machine, however, will never need to backtrack, and hence is a DFA.