Example:

If δ(${q}_{0}$) = ɸ (Dead State) [Dead state not allowed at DFA but allowed at NFA] that means this machine reject b.

Now ω = aab, δ(${q}_{0}$, aab)

At final we can get a set of final states, if at least one of the states is final state then NFA accept the string. So, it is an accepted string (aab).

Example:

Let ω = ab

Example: