Lecture 6 (NFAs to DFAs), 9/18/17

Concepts, definitions, theorems:

         Closure property of RLs: The set of RLs is closed under regular operations o, *, U (also complement and intersection)

         Example: L = strings that do not contain substring 010

o    L1 = strings containing substring 010

o    L is a complement of L1

o    We know that L1 is regular (can easily create NFA for it), so L must be regular too