1. language closure properties
2. types of languages based on set representation
3. a turing machine diagram and some content
4. a pda diagram and some content
5. Language venn diagram
6. Convert to chompsky normal form example
7. cartesian product construction of dfa for intersection etc..
8. subset construction (NFA→ DFA)
9. distinguishability, index set

TM to add a 1 to a binary number on input tape

Chomsky example

2 pdas