= Read-only-from-left Turing acceptor
= ROFL
{c}
{synonym}
A deterministic <single-tape Turing machine> that leaves every scanned symbol unchanged and moves one cell right after every nonhalting transition. Such machines decide exactly the <regular languages>. A <deterministic finite automaton> simulates the finite control, with accepting states determined by the blank-only continuation after the <input>; conversely, a machine simulating a <deterministic finite automaton> halts on the first blank.
Back to article page
