In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton —also known as deterministic finite acceptor, deterministic finite-state machine, or deterministic finite-state automaton —is a finite-state machine that accepts or rejects a given string of symbols, by running through a state sequence uniquely determined by the string. Wikipedia