pushdown automata

Question

what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.

Comments

I think it will be the pda

---

Sir, this also can be pda of this??? @Prateek Raghuvanshi

---

Connecting state q1 with final state will take care when m=0..

---

@MiNiPanda if m>0 then it is correct right??

---

@arya_stark it is not correct because in language a's are double than b's ,so we have to take care of that ,see my dpda.