Faster algorithm for bisimulation equivalence of normed context-free processes

  • Authors:

  • Sławomir Lasota;Wojciech Rytter

  • Affiliations:

  • Institute of Informatics, Warsaw University, Warsaw, Poland;Institute of Informatics, Warsaw University, Warsaw, Poland

  • Venue:
  • MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The fastest known algorithm for checking bisimulation equivalence of normed context-free processes worked in O(n13) time. We give an alternative algorithm working in $O(n^8 {\sl polylog} n)$ time, As a side effect we improve the best known upper bound for testing equivalence of simple context-free grammars from $O(n^7 {\sl polylog} n)$ to $O(n^6 {\sl polylog} n)$.