@article{KIEFER2013101,
    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.},
    Author = {Kiefer, Stefan},
    File = {1-s2.0-S0020019012003079-main (0) - a - a - r.pdf},
    ISSN = {0020-0190},
    Journal = {Information Processing Letters},
    Keywords = {Basic process algebra, Bisimilarity, Computational complexity},
    Number = {4},
    Pages = {101 - 106},
    Title = {BPA bisimilarity is EXPTIME-hard},
    URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003079},
    Volume = {113},
    Year = {2013},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0020019012003079},
    bdsk-url-2 = {https://doi.org/10.1016/j.ipl.2012.12.004},
    date-added = {2019-02-12 09:57:11 +0100},
    date-modified = {2019-02-12 09:57:11 +0100},
    file-2 = {kiefer (0) - a - a - r.pdf},
    doi = {10.1016/j.ipl.2012.12.004}
}

@article{KIEFER2013101, 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.}, Author = {Kiefer, Stefan}, File = {1-s2.0-S0020019012003079-main (0) - a - a - r.pdf}, ISSN = {0020-0190}, Journal = {Information Processing Letters}, Keywords = {Basic process algebra, Bisimilarity, Computational complexity}, Number = {4}, Pages = {101 - 106}, Title = {BPA bisimilarity is EXPTIME-hard}, URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003079}, Volume = {113}, Year = {2013}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0020019012003079}, bdsk-url-2 = {https://doi.org/10.1016/j.ipl.2012.12.004}, date-added = {2019-02-12 09:57:11 +0100}, date-modified = {2019-02-12 09:57:11 +0100}, file-2 = {kiefer (0) - a - a - r.pdf}, doi = {10.1016/j.ipl.2012.12.004} }