is it possible to minimize pushdown automata? is it possible to minimize pushdown automata?
If no, why?
Is it because for minimization the equivalence classes need to have a finite index and we cannot guarantee that for CFG?
Unfortunately the problem is not computable.  It is undecidable even to tell if two arbitrary PDAs are equivalent; minimizing a PDA is even harder.