| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427537 | Information Processing Letters | 2013 | 6 Pages |
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.
► It is shown that BPA bisimilarity is EXPTIME-hard. ► This improves on PSPACE-hardness, which was shown by Srba in 2002. ► The proof is based on EXPTIME-hardness of a reachability game involving succinct counters.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Stefan Kiefer,