PDA Accepting a String

Definition

For a PDA $M$ to accept a string $x$:

• Start with an empty stack (initial state)
• Read all of $x$
• End in an accepting state
• End with an empty stack

Example

For $\Sigma =\{0,1\}$ For $L=\{x\in {\Sigma }^{\ast }:{\#}_0(x)={\#}_1(x)\}$ Find a PDA that accepts $L$