On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes

Dung T. Huynh, Lu Tian. On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes. In Osman Abou-Rabia, Carl K. Chang, Waldemar W. Koczkodaj, editors, Computing and Information - ICCI 93, Fifth International Conference on Computing and Information, Sudbury, Ontario, Canada, May 27-29, 1993, Proceedings. pages 3-7, IEEE Computer Society, 1993.

@inproceedings{HuynhT93,
  title = {On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes},
  author = {Dung T. Huynh and Lu Tian},
  year = {1993},
  tags = {context-aware},
  researchr = {https://researchr.org/publication/HuynhT93},
  cites = {0},
  citedby = {0},
  pages = {3-7},
  booktitle = {Computing and Information - ICCI 93, Fifth International Conference on Computing and Information, Sudbury, Ontario, Canada, May 27-29, 1993, Proceedings},
  editor = {Osman Abou-Rabia and Carl K. Chang and Waldemar W. Koczkodaj},
  publisher = {IEEE Computer Society},
  isbn = {0-8186-4212-2},
}