Theory of Computation - Old Questions

2.  How can you define the language accepted by a PDA? Explain how a PDA accepting language by empty stack is converted into an equivalent PDA accepting by final state and vice-versa.    (2+4+4)