Questions

Slides

Problems

Table for closure properties of different types of languages

Table for different CFGS encountered

Table for type of language encountered

What to include in cheat cheat

CFG

CFL

Chomsky Normal Form

Pushdown Automata

Regular Languages → Context free languages (DFA → CFG )

PDA → CFG

Pumping Lemma CFL

Deterministic PDAs

Turing machine

Church Turing Thesis