"On the Computational Complexity of Bisimulation."

Faron Moller, Scott A. Smolka (1995)

> Home

Details and statistics

DOI: 10.1145/210376.210406

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/csur/MollerS95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/csur/MollerS95
Faron Moller, Scott A. Smolka:
On the Computational Complexity of Bisimulation. ACM Comput. Surv. 27(2): 287-289 (1995)

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.