Formul languages and automata

3. Construct a PDA recognizing L={0k1l2ml=k+m and k,l,m0}. 4. Construct a PDA and a CFG recognizing L={amb2ncnd2mm,n0}