Could anybody help me design a PDA for the language $\{ 0^n 1^m  | n  m \}$?Here is what I currently have:
Constructing a PDA for the language $\{ 0^n 1^m | n  m \}$
formal languages;automata;context free;pushdown automata