Thursday, September 9

Context Free Languages

On this day we reviewed context free grammars, pushdown automata, and some of the characteristics of context free grammars.  We remembered that deterministic pushdown automata recognize all of the context free grammars whereas deterministic pushdown automata do not.

We then reviewed the pumping lemma for context free languages.