When are emptiness and containment decidable for probabilistic automata? (Q2662671)
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 7332992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | When are emptiness and containment decidable for probabilistic automata? |
scientific article; zbMATH DE number 7332992 |
Statements
When are emptiness and containment decidable for probabilistic automata? (English)
0 references
14 April 2021
0 references
probabilistic automata
0 references
emptiness
0 references
containment
0 references
ambiguity
0 references
0.9579009
0 references
0.8439227
0 references
0.84063447
0 references
0.84063447
0 references
0.83394104
0 references
0.83344704
0 references
0.82874817
0 references
0.8280363
0 references
0.82719463
0 references
