To convert a final$-$state PDA to an empty$-$stack PDA, we put it between a new start state S and a new state E and define some new edges and new transition instructions for those new edges. For instance, for the final$-$state PDA shown in Fig. $1,$ we would get the following empty$-$stack PDA. The language accepted by the final state pda shown in fig $1$ below is: