Abstract models of machines performing computation from an input by moving through a series of intermediate states. When an automaton reads a symbol as input, it changes to another state according to an instruction (given by a transition function). The stored-program computer and the living cell are two concrete realization of an automaton.
