Finite Automaton

A finite automaton is a machine with a fixed, finite set of states that reads a string one symbol at a time and decides whether to accept it.