BPA Bisimilarity is EXPTIME-hard
Formal Languages and Automata Theory
2012-12-04 v2 Computational Complexity
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.
Cite
@article{arxiv.1205.7041,
title = {BPA Bisimilarity is EXPTIME-hard},
author = {Stefan Kiefer},
journal= {arXiv preprint arXiv:1205.7041},
year = {2012}
}
Comments
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