title: Does this language have a Pushdown Automata ( PDA )?
body: <p>the language is:  { A<sup>n</sup> B<sup>(2n)</sup> C<sup>n</sup> | where n>=0 }</p>
  
  <p>I think it has, because you can process it like this: push A's, push B's, for each C pop three times from stack, if there are no C's and stack is empty, return true, else return false.</p>