BPA Bisimilarity is EXPTIME-hard
classification
💻 cs.FL
cs.CC
keywords
bisimilarityexptime-hardproblemstacksymbolsalgebraasksbasic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.