Equivalence of DFA and NFA

We naturally try to find the relationship between DFA and NDFA. Intuitively we now feel that:

i. A DFA can simulate the behaviour of NDFA by increasing the number of states. (In other words. a DFA (Q, L, 8, qQ, F) can be viewed as an
NDFA (Q, L, 8′, qQ, F) by defining 8′(q, a) = {8(q, a)}.)

ii. Any NDFA is a more general machine without being more powerful We now give a theorem on the equivalence of DFA and NDFA.