CSSE 474: Day 9

Topics

• Finite automata: Closure under union
• Nondeterminism
• Nondeterministic finite automata
• Equivalence of NFA and DFA

Homework

1. 1.22 (a)
2. 1.31
3. Show that the regular languages are closed under complementation and intersection. Have a look at the poof for theorem 1.25 for hints on how one could go about prooving these two theorems.