1. A DEA (Deterministic Finite Automaton) is a mathematical model of computation that consists of a finite set of states, input symbols, transitions between states depending on the input symbol, an initial state, and a set of accepting states.
2. A NEA (Nondeterministic Finite Automaton) is similar to a DEA but allows multiple transitions from a given state and input symbol.
3. The process to convert a NEA to a DEA involves constructing a transition table from the NEA and scanning states, tracking new states until no new states are found, then marking accepting states.