arXiv Open Access 2012

BPA Bisimilarity is EXPTIME-hard

Stefan Kiefer

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.FL cs.CC

Penulis (1)

Stefan Kiefer

Format Sitasi

APA MLA BibTeX

Kiefer, S. (2012). BPA Bisimilarity is EXPTIME-hard. https://arxiv.org/abs/1205.7041

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓