BPA Bisimilarity is EXPTIME-hard
arXiv:1205.7041
Abstract
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.
technical report for a an article that is to appear in Information Processing Letters. The present version takes into account improvements prompted by the journal's reviewers