What is DFA?

DFA stands for Deterministic Finite Automaton. It is a finite state machine that accepts or rejects strings of symbols. It is 'deterministic' because for each state and input symbol, there is exactly one transition to another state. DFAs are used in various applications like lexical analysis in compilers, pattern matching, and protocol analysis. They are fundamental in the theory of computation and formal language theory.