| Article ID: | iaor2013784 |
| Volume: | 113 |
| Issue: | 4 |
| Start Page Number: | 101 |
| End Page Number: | 106 |
| Publication Date: | Feb 2013 |
| Journal: | Information Processing Letters |
| Authors: | Kiefer Stefan |
| Keywords: | algebra, algebraic optimization, exponential time |
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.