Deciding Bisimilarity is P-Complete

José L. Balcázar, Joaquim Gabarró, Miklos Santha. Deciding Bisimilarity is P-Complete. Formal Asp. Comput., 4(6A):638-648, 1992.

@article{BalcazarGS92,
  title = {Deciding Bisimilarity is P-Complete},
  author = {José L. Balcázar and Joaquim Gabarró and Miklos Santha},
  year = {1992},
  tags = {completeness},
  researchr = {https://researchr.org/publication/BalcazarGS92},
  cites = {0},
  citedby = {0},
  journal = {Formal Asp. Comput.},
  volume = {4},
  number = {6A},
  pages = {638-648},
}