Formal languages and Automata

I need help with these subjects:

- Ambiguity of context free grammars
- Pumping lemma
- Pushdown automata
- Pushdown automata to context free grammar conversion
- Context free grammar to pushdown automata conversion