On the complexity of checking semantic equivalences between pushdown processes and finite-state processes