- 1 sheet of 8.5" by 11.0" piece of paper with notes written on it
- Pencil or pen
- eraser

What's covered by the exam.

- Anything in Chapters 0,1,or 2 of the text book (except Section 2.4 Deterministic CFG).
- Anything in the published notes, through last Tuesday, Nov. 5, 2013.
- Anything covered by any of the Homeworks. Including
- Inductively defined sets.
- proofs by induction.
- and proofs by contradiction.

- Anything we talked about in class.

Topics you should know

- Definitions of formalisms
- Regular Language
- Regular Expression
- DFA
- NFA
- NFAe
- GenNFA
- Context Free Langauge
- Context Free Grammar
- Push down Automata

- Skills
- Translating word descriptions of a language into any of the formalisms
- Executing DFA's. NFA's, or CFG, or PDA by hand over a string

- Algorithms (Including but not limited to those discused here).
- RegExp to Finite automaton
- Finite automaton to RegExp (state ripping).
- NFA to DFA
- Closure properties of Regular and Context Free languages.
- CFG to PDA (and vice-versa)

- Other topics
- Applyng the pumping-lemma to prove a language is not regular.
- Applyng the CF pumping-lemma to prove a language is not Context Free.

- Overview slides to pay attention to.
- Doing proofs by induction over inductively defined sets.
- Algorithms for regular languages.
- Using the pumping lemma.
- Context Free big picture.