unambiguous finite automaton
special kind of a nondeterministic finite automaton (NFA). Each deterministic finite automaton (DFA) is an UFA, but not vice versa. DFA, UFA, and NFA recognize exactly the same class of formal languages
deterministic finite automata
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