Also a deterministic finite state automaton: every outgoing edge is labelled with a unique letter of the alphabet. A DFA can be simulated in a straightforward manner; every NFA is equivalent to a DFA (and every DFA is a NFA).

# DFA (thing)

See all of DFA, no other writeups in this node.