Suppose th $PDA, $ $P=(\{q,p\},\{0,1\},\{Z_{0},X\},\delta,q,Z_{0}.\{p\})$ has the following transition function$:$
- $\delta(q,0,Z_{0})=\{(q,XZ_{0})\}$
- $\delta(q,0,X)=\{(q,XX)\}$
- $\delta(q,1,X)=\{(q,X)\}$
- $\delta(q,\in,X)=\{p,\in\}$
- $\delta(p,\in,X)=\{p,\in\}$
- $\delta(p,1,X)=\{(p,XX)\}$
- $\delta(p,1,Z_{0})=\{p,\in\}$
Starting from the initial $ID$ $(q,w,Z_{0}),$
- Convert $P$ to another $PDA$ $P_{1}$ that accepts by empty stack the same language that $P$ accepts by final state;i.e.,$N(P_{1})=L(P).$
- Find a $PDA$ $P_{2}$ such that $L(P_{2})=N(P)$ i.e., $P_{2}$ accepts by final state what $P$ accepts by empty stack.