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:
“I brush my hair,
waiting in the pain machine for my bones to get hard,
for the soft, soft bones that were laid apart
and were screwed together. They will knit.
And the other corpse, the fractured heart,
I feed it piecemeal, little chalice. I’m good to it.”
—Anne Sexton (1928–1974)