Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Branching Bisimilarity on Normed BPA Is EXPTIME-complete   We put forward an exponential-time algorithm for deciding branching
bisimilarity on normed BPA (Bacis Process Algebra) systems. The decidability of
branching (or weak) bisimilarity on normed BPA was once a long standing open
problem which was closed by Yuxi Fu. The EXPTIME-hardness is an inference of a
slight modification of the reduction presented by Richard Mayr. Our result
claims that this problem is EXPTIME-complete.

0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
9
The categories of this paper are: nlin
2
The categories of this paper are: math
28
The categories of this paper are: alg-geom
34
The categories of this paper are: chem-ph
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
30
The categories of this paper are: q-alg
17
The categories of this paper are: q-fin
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
6
The categories of this paper are: astro-ph
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol