why do we add an initial state while transforming PDA acceptance by final state into PDA acceptance by empty string ?

Question

I have gone through this link already but still couldn't catch up the logic , so please clarify what is it trying to convey ?

 

http://cs.stackexchange.com/questions/44195/pda-transformation-between-acceptance-by-empty-stack-and-final-states?rq=1

Comments

we have to ensure stack is not empty at beginning

---

But that would be ensured by the automaton(which accepts by final state)which will have some initial symbol on the stack before starting any input transitions .

---

The new state is used to add this extra symbol on stack. 

http://www.cs.ucr.edu/~jiang/cs150/slides4week7_PDA+EquivToCFG.pdf