Lecture 5 (Computation Theory) Nondeterministic Finite Automata

An NFA accepts a string w when:

1. A.Every possible computation path on w ends in an accept state
2. B.At least one possible computation path on w ends in an accept state
3. C.The machine reaches an accept state without using any epsilon transitions
4. D.A majority of the possible computation paths on w end in an accept state