A Deterministic Finite Automaton (DFA) is a fundamental mathematical model of computation, a simple abstract machine that processes an input string of symbols. For each input, it moves to a single, predetermined state, leading to an unambiguous accept or reject decision.