On the Computational Complexity of Bisimulation, Redux

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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.