Th: Let L be a set accepted by an NFA. Then there exists a DFA that accepts L.
Read the proof pp. 105-106: The equivalent DFA Keeps track of all the states that the NFA could be in.
