2000 character limit reached
Branching Bisimilarity of Normed BPA Processes is in NEXPTIME (1407.0645v2)
Published 2 Jul 2014 in cs.LO and cs.FL
Abstract: Branching bisimilarity on normed BPA processes was recently shown to be decidable by Yuxi Fu (ICALP 2013) but his proof has not provided any upper complexity bound. We present a simpler approach based on relative prime decompositions that leads to a nondeterministic exponential-time algorithm; this is close to the known exponential-time lower bound.