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
formula_1 where
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 (a HALT state) for the machine to accept a regular language (Not including the empty language).