Lecture 19

Learning objectives

After this class, you should be able to:

1. Prove that npdas are equivalent to context free grammars.
2. Given an ndpa, give an equivalent context free grammar.
3. Given a context free grammar, given an equivalent npda.
4. Given a language, give a npda for it.

Reading assignment

1. Section 7.2.
2. Lecture 19 slides on Blackboard.

Exercises and review questions

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

• Questions on next lecture's material
  1. Given an example of a deterministic push down automaton. (Represent it using a transition graph.)

---

Last modified: 31 Jan 2014