I am trying to convert the follow language$$L = \{0^m1^n \ | \ 0 \le m \le n \le 2m\}$$We have an exam in 2 days and the professor didn't teach us much about PDA's. They will be on the test though and I am freaking out because I have no idea how to do them. Could anyone give me a hint or get me started on this example?
Converting a language to a PDA?
formal languages;regular languages;context free;pushdown automata