Draw the transition diagrams for push-down automata for the following languages. Give direct constructions, not conversions from CFGs, and give a brief description in English of your strategy for each problem.

 

(a) {a'b'c* : 2i = |j k|} (b) {w e {a, b}* : na(w) = 2n3(w)}