On the computational complexity of bisimulation
Faron Moller, Scott A. Smolka · ACM Computing Surveys · 1995
article Free Access Share on On the computational complexity of bisimulation Authors: Faron Moller SICS, Kista, Sweden SICS, Kista, SwedenView Profile , Scott A. Smolka State Univ. of New York at Stony Brook, Stony Brook State Univ. of New York at Stony Brook, Stony BrookView Profile Authors Info & Claims ACM Computing SurveysVolume 27Issue 2pp 287–289https://doi.org/10.1145/210376.210406Published:01 June 1995Publication History 6citation492DownloadsMetricsTotal Citations6Total Downloads492Last 12 Months28Last 6 weeks9 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF