CFGs
- DFA to CFG impt normal lang?
- CFG to CNF Chomsky Normal Form (CNF)
PDA
- Proof from grammer/pda
- Closure properties/CFGs, (for CFG if both regular is their union regular? yes! B/c see hw lol)
- If we have a language A,B how do we create the union of both of them?
- think about closure properties
- What about intersection? Concat? super impt, how to prove?
- Given grammer → PDA impt
- pumping lemma for if regular!
TMs
- description of TMs impt