Lecture 6

Learning objectives

After this class, you should be able to:

1. Explain what it means for two automata to be equivalent.
2. Prove that NFAs and DFAs are equivalent.
3. Given a NFA, create an equivalent DFA.

Reading assignment

1. Section 2.3.
2. Lecture 6 slides on Blackboard.
3. Definition 3.1, page 72.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 2.3, exercise #1.
  2. Section 2.3, exercise #2.
  3. Section 2.3, exercise #11.
  4. Section 2.3, exercise #12.

• Questions on next lecture's material
  1. Section 3.1, exercise #4.

---

Last modified: 29 Dec 2013