Read-only right moving Turing machines
Read-only right moving Turing machines are a particular type of Turing machine.Definition
The definition based on a single infinite tape defined to be a 7-tuple
where
- is a finite set of states
- is a finite set of the tape alphabet/symbols
- is the blank symbol
- , a subset of not including b is the set of input symbols
- is a function called the transition function, R is a right movement.
- is the initial state
- 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 for the machine to accept a regular language.An example Read Only right moving Turing machine
