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.

Authors

Faron Moller

This author has not been identified. Look up 'Faron Moller' in Google

Scott A. Smolka

This author has not been identified. Look up 'Scott A. Smolka' in Google