Terminology and Basics
The size of the NFA is linear in the size of the RE, while the size of the DFA might be as bad as quadratic.
The size of the NFA is linear in the size of the RE, while the size of the DFA might be as bad as exponential.
The running time to simulate the NFA is linear in the size of the RE, while the running time for the DFA might be as bad as quadratic.
The running time to simulate the NFA is linear in the size of the RE, while the running time for the DFA might be as bad as exponential.
The NFA only has two kinds of transitions (match and e), while the DFA requires determining the correct transition for each possible input character.
The DFA might require backing up in the input stream, while the NFA does not. Answers
None!