(Unless otherwise specified, questions are selected from the textbook Michael Sipser, Introduction to the Theory of Computation, Second Edition, Thomson Course Technology.)
Write a context-free grammar (CFG) for either of the following the languages
(a) { 0n 1m | 0 ≤ n < m }
(b) { 0n 1m | n > m ≥ 0}
Note that neither language should contain empty string ε. Why?
Construct a pushdown automaton (PDA) for the language you select for problem 1. You may directly construct a PDA or use the procedure given in Theorem 2.20 (i.e., Lemma 2.21 and its proof) to construct a PDA from the CFG you have developed for problem 1.
Question 2.9, page 129.
Give a PDA for the language defined in question 2.9 of page 129, without using the grammar you develop for problem 3.