Question: is every nfa a dfa?
Answer: In particular, every DFA is also an NFA. ... Using the subset construction algorithm, each NFA can be translated to an equivalent DFA; i.e., a DFA recognizing the same formal language. Like DFAs, NFAs only recognize regular languages.