1. Pushdown Automata - Examples Lecture 18 Section 2.2 Mon, Oct 1, 2007

2. Examples • Design a PDA that accept the following language. • {w | w contains an equal number of a’s and b’s}

3. Examples • Let  = {a, b, c, +, *, (, )}. • Design a PDA that accepts {w | w contains balanced parentheses} • Design a PDA that accepts {w | w is a valid algebraic expression}