Questions about mathematical devices that read an input stream symbol by symbol and use a state transition map to produce an output stream, maybe using secondary storage.

Automata, or state machines, are mathematical devices often used to define formal languages by way of accepting, or recognizing, or deciding strings belonging to the target language. Commonly encountered varieties of automata are finite automata, pushdown automata, linear-bounded automata, and Turing machines.

Related tags:

history | excerpt history