Faron Moller, Scott A. Smolka. On the Computational Complexity of Bisimulation, Redux. In Dina Q. Goldin, Alexander A. Shvartsman, Scott A. Smolka, Jeffrey Scott Vitter, Stanley B. Zdonik, editors, PCK50 - Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop, San Diego, California, USA, June 8th, 2003. pages 55-59, ACM, 2003.
@inproceedings{MollerS03,
title = {On the Computational Complexity of Bisimulation, Redux},
author = {Faron Moller and Scott A. Smolka},
year = {2003},
researchr = {https://researchr.org/publication/MollerS03},
cites = {0},
citedby = {0},
pages = {55-59},
booktitle = {PCK50 - Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop, San Diego, California, USA, June 8th, 2003},
editor = {Dina Q. Goldin and Alexander A. Shvartsman and Scott A. Smolka and Jeffrey Scott Vitter and Stanley B. Zdonik},
publisher = {ACM},
isbn = {1-58113-604-8},
}