We provide an algorithm for deciding simple grammar bisimilarity whose complexity is polynomial in the valuation of the grammar (maximum seminorm among production rules). Since the valuation is at most exponential in the size of the grammar, this gives rise to a (single) exponential running time. Previously only a double-exponential algorithm was known. As an application, we provide a conversion from context-free session types to simple grammars whose valuation is linear in the size of the type. In this way, we provide the first polynomial-time algorithm for deciding context-free session type equivalence.

@article{paperbot12626,
  title = {Simple grammar bisimilarity, with an application to session type equivalence},
  author = {Diogo Poças and Gil Silva and Vasco T. Vasconcelos},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 22, Issue 4},
  year = {2026},
  doi = {10.46298/lmcs-22(4:5)2026}
}