+A [Deterministic Finite Automaton](/wiki/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](/wiki/State), leading to an unambiguous accept or reject decision.
+## See also
+- [NFA](/wiki/NFA)
+- [Regular Language](/wiki/Regular_Language)
+- [Formal Language](/wiki/Formal_Language)