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:
“There is no question but that if Jesus Christ, or a great prophet from another religion, were to come back today, he would find it virtually impossible to convince anyone of his credentials ... despite the fact that the vast evangelical machine on American television is predicated on His imminent return among us sinners.”
—Peter Ustinov (b. 1921)