1. Let L = {ai bj ak i + j ≥ k}.

• Construct a context free grammar for L.

• Convert your grammar to an equivalent one in Greibach Normal Form.

• Construct a PDA (Push Down Automata) based on your grammar in Greibach Normal
Form in the previous problem. You have to clearly specify Σ (input symbols) and Γ (stack
symbols) and use a transition diagram to present your PDA.
2. Prove that ACF G = {hG, ωi G is a context free grammar and ω ∈ L(G)} is decidable.

3. Prove that N ECF G = {hGi G is a context free grammar and L(G) 6= ∅} is decidable.