A polynomial algorithm for deciding bisimilarity of normed context-free processes

Yoram Hirshfeld, Mark Jerrum, Faron Moller*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

102 Scopus citations


The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes is due to Huynh and Tian (1994), who put the problem in ∑P2 = NPNP: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by describing a polynomial-time algorithm which solves this problem. As a corollary, we have a polynomial algorithm for the equivalence problem for simple grammars.

Original languageEnglish
Pages (from-to)143-159
Number of pages17
JournalTheoretical Computer Science
Issue number1-2
StatePublished - 20 May 1996
Externally publishedYes


FundersFunder number
ESPRIT Basic Research Action7166
Esprit Working Group7097
Swedish Institute of Computer Science
UK Science and Engineering Research Council
Nuffield FoundationGR/F 90363


    Dive into the research topics of 'A polynomial algorithm for deciding bisimilarity of normed context-free processes'. Together they form a unique fingerprint.

    Cite this