Lecture 18

Learning objectives

After this class, you should be able to:

1. Define a nondeterministic pushdown automaton (npda).
2. Given an ndpa and a string, show a sequence of instantaneous descriptions defining the moves of the automaton on that input.
3. Given an npda, give the transition graph for it.
4. Given a language, give a npda for it.

Reading assignment

1. Section 7.1.
2. Lecture 18 slides on Blackboard.

Exercises and review questions

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

• Questions on next lecture's material
  1. None.

---

Last modified: 31 Jan 2014