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.
Read more about Read-only Turing Machine: Theory, Applications, See Also
Famous quotes containing the word machine:
“One machine can do the work of fifty ordinary men. No machine can do the work of one extraordinary man.”
—Elbert Hubbard (1856–1915)