[Wikipedia] Read-only right moving Turing machines
Turing Machine - Read and Write test
Turing on artificial intelligence (1) (2064: Read Only Memories)
10 Restrictedturing machine
Turing on artificial intelligence (2) (2064: Read Only Memories)
A read-only Turing machine or Two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape. The machine in its bare form is equivalent to a Deterministic finite automaton in computational power, and therefore can only parse a regular language.
Explore contextually related video stories in a new eye-catching way. Try Combster now!