I cant do myself:

language consisting of all strings that do not contain two or more conse
cutive a s and do not end with b ---------- regex
Minimizing states, how to write in exam
CFG for:
Prefix equal number of a and b
count(a) = 2*count(b) + 1
{a,b,c}* | count(a) + count(b) = count(c)
Peter Linz 134 12) Given G show how we can generate G' = head(G)
CYK algorithm
Draw and see PDA for {a^n b^m | n <= m <= 3*n}

TODO myself:
Conversion: PDA <----------> CFG
Pumping lemma problems
Study proofs for closure properties.
Decidability of CFLs