deterministic finite automata

Also known as DFA, deterministic finite acceptor, deterministic finite state machine, DFSM

finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string