BPA Bisimilarity is EXPTIME-hard [article]

Stefan Kiefer
2012 arXiv   pre-print
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.
arXiv:1205.7041v2 fatcat:4iwykuvsffeuzdzd6ssconycam