The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 21:43, 5 March 2024
scientific article; zbMATH DE number 6299333
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata |
scientific article; zbMATH DE number 6299333 |
Statements
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (English)
0 references
2 June 2014
0 references
