On the Computational Complexity of Bisimulation - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Faron Moller, Scott A. Smolka. On the Computational Complexity of Bisimulation. ACM Computing Surveys, 27(2):287-289, 1995.

@article{MollerS95:0,
  title = {On the Computational Complexity of Bisimulation},
  author = {Faron Moller and Scott A. Smolka},
  year = {1995},
  researchr = {https://researchr.org/publication/MollerS95%3A0},
  cites = {0},
  citedby = {0},
  journal = {ACM Computing Surveys},
  volume = {27},
  number = {2},
  pages = {287-289},
}

runs on WebDSL