3 ms·
Strictly speaking this is not a turing machine, but a finitely bounded automata, which is obviously equivalent to a DFA.
by likpok 17y ago
Strictly speaking this is not a turing machine, but a finitely bounded automata, which is obviously equivalent to a DFA.