Lecture 4 (DFAs vs. NFAs), 1/25/18

Concepts, definitions (in italics):

o    DFAs are special cases of NFAs, but not vice versa

         w is accepted by a NFA M if there exists an accepting computation of M on w

         L(M), the language accepted by FSA M, is the set of strings accepted by it

Reading and Homework: