Sciweavers

IANDC
2010

Complexity of deciding bisimilarity between normed BPA and normed BPP

13 years 10 months ago
Complexity of deciding bisimilarity between normed BPA and normed BPP
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known exponential upper bound by ˇCern´a, Kˇret´ınsk´y, Kuˇcera (1999). We first suggest an O(n3 ) transformation of the BPP process into “prime form”. Our algorithm then relies on a polynomial bound for a “finite-state core” of the transition system generated by the (transformed) BPP process.
Petr Jancar, Martin Kot, Zdenek Sawa
Added 25 Jan 2011
Updated 25 Jan 2011
Type Journal
Year 2010
Where IANDC
Authors Petr Jancar, Martin Kot, Zdenek Sawa
Comments (0)