1. (February 29) Use a general algorithm for transforming a context-free grammar into a pushdown automaton to design an automaton corresponding to the context-free grammar with the following rules:
2. (February 29) Use pumping lemma for finite automata to prove that the language L consisting of all the words of the type wawRb is not regular, where a and b are letters, w is an arbitrary word, and wR is the same word in reserve order.
3. (March 2) Use pumping lemma for finite automata to prove that the following language L is not regular: it is the language consisting of all the words that have either more b's than a's or the same number of a's and b's.