<P> For aq ∈ Q, let E (q) denote the set of states that are reachable from state q by following ε - transitions in the transition function Δ, i.e., p ∈ E (q) iff there is a sequence of states q,..., q such that </P> <Ul> <Li> q = q, </Li> <Li> q ∈ Δ (q, ε) for each 1 ≤ i <k, and </Li> <Li> q = p . </Li> </Ul> <Li> q = q, </Li> <Li> q ∈ Δ (q, ε) for each 1 ≤ i <k, and </Li>

A language accepted by an nfa is also accepted by some dfa but not vice-versa