BPA Bisimilarity is EXPTIME-hard
  Given a basic process algebra (BPA) and two stack symbols, the BPA bisimilarity problem asks whether the two stack symbols are bisimilar. We show that this problem is EXPTIME-hard. 
Stefan Kiefer
cs.FL cs.CC