Lecture 5

Learning objectives

After this class, you should be able to:

1. Define a nondeterministic finite acceptor (NFA).
2. Given a NFA, give its graph representation, and given a graph representation of a NFA, give its formal definition.
3. Given a NFA, either through its formal definition or through its graph representation, describe the language it accepts and prove the correctness of your answer.
4. Given a NFA and an input, trace the possible steps executed by the NFA on that input and determine whether or not the input is accepted.
5. Given a language construct a NFA for it.

Reading assignment

1. Section 2.2.
2. Lecture 5 slides on Blackboard.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 2.2, exercise #4.
  2. Section 2.2, exercise #10a.
  3. Section 2.2, exercise #7.
  4. Section 2.2, exercise #12.
  5. Section 2.2, exercise #18.

• Questions on next lecture's material
  1. Section 2.2, exercise #2.

---

Last modified: 29 Dec 2013