Lecture 20

Learning objectives

After this class, you should be able to:

1. Define deterministic pushdown automata (dpda) and determinisitic context free languages.
2. Given a language, give a dpda for it.
3. Prove that dpdas are not equivalent to ndpas.

Reading assignment

1. Section 7.3.
2. Lecture 20 slides on Blackboard.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 7.3, exercise #1.
  2. Section 7.3, exercise #2.

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

---

Last modified: 31 Jan 2014