 Finite-state automaton

A finite-state automaton recognizes a formal language by updating one of finitely many states as it reads each input symbol.