Find link

language:

Find link is a tool written by Edward Betts.

searching for Read-only Turing machine 2 found (4 total)

alternate case: read-only Turing machine

Deterministic finite automaton (3,736 words) [view diff] no match in snippet view article find links to article

In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as deterministic finite acceptor

Regular language (3,424 words) [view diff] exact match in snippet view article find links to article

it can be generated by a prefix grammar it can be accepted by a read-only Turing machine it can be defined in monadic second-order logic (Büchi–Elgot–Trakhtenbrot