On the computational complexity of bisimulation, redux (Q703845)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational complexity of bisimulation, redux |
scientific article; zbMATH DE number 2126482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of bisimulation, redux |
scientific article; zbMATH DE number 2126482 |
Statements
On the computational complexity of bisimulation, redux (English)
0 references
11 January 2005
0 references
One-counter machines
0 references
Equivalence-checking
0 references
Model-checking
0 references
Automata
0 references
Formal languages
0 references
Bisimulation equivalence
0 references
Complexity
0 references
0 references
0 references
0 references
0.7844881415367126
0 references
0.7370651960372925
0 references
