Read-only right moving Turing machines

The definition based on a single infinite tape defined to be a 7-tuple

${\displaystyle M=\langle Q,\Gamma ,b,\Sigma ,\delta ,q_{0},F\rangle }$ where

• ${\displaystyle Q}$ is a finite set of states
• ${\displaystyle \Gamma }$ is a finite set of the tape alphabet/symbols
• ${\displaystyle b\in \Gamma }$ is the blank symbol (the only symbol allowed to occur on the tape infinitely often at any step during the computation)
• ${\displaystyle \Sigma }$, a subset of ${\displaystyle \Gamma }$ not including b is the set of input symbols
• ${\displaystyle \delta :Q\times \Gamma \rightarrow Q\times \Gamma \times \{R\}}$ is a function called the transition function, R is a right movement (a right shift).
• ${\displaystyle q_{0}\in Q}$ is the initial state
• ${\displaystyle F\subseteq Q}$ is the set of final or accepting states

In the case of these types of Turing Machines, the only movement is to the right. There must exist at least one element of the set F (a HALT state) for the machine to accept a regular language (Not including the empty language).

• DFA
• NFA
• Finite-state machine
• Read-only Turing machine
• Turing machine
• Turing machine examples

• Davis, Martin; Ron Sigal; Elaine J. Weyuker (1994). Second Edition: Computability, Complexity, and Languages and Logic: Fundamentals of Theoretical Computer Science (2nd ed.). San Diego: Academic Press, Harcourt, Brace & Company. ISBN 0-12-206382-1.