"On the Computational Complexity of Bisimulation, Redux."

Faron Moller, Scott A. Smolka (2003)

> Home

Details and statistics

DOI: 10.1145/778348.778357

access: closed

type: Conference or Workshop Paper

metadata version: 2022-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/birthday/MollerS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/MollerS03
Faron Moller, Scott A. Smolka:
On the Computational Complexity of Bisimulation, Redux. PCK50 2003: 55-59

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.