Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time (Q2851063)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6213307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time |
scientific article; zbMATH DE number 6213307 |
Statements
2 October 2013
0 references
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time (English)
0 references
0.8541110754013062
0 references
0.8391954302787781
0 references
0.822875440120697
0 references
0.8066144585609436
0 references
