Name
Abstract | ||
|---|---|---|
This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not. A numberless probabilistic automaton can be instantiated into a probabilistic automaton by specifying the exact values of the non-zero probabilistic transitions. We show that the two following properties of numberless probabilistic automata are recursively inseparable: all instances of the numberless automaton have value 1, no instance of the numberless automaton has value 1. |
Year | Venue | Field |
|---|---|---|
2014 | Lecture Notes in Computer Science | Discrete mathematics,Combinatorics,Fair coin,Decision problem,Deterministic automaton,Mobile automaton,Computer science,Timed automaton,Probabilistic automaton,Recursion,Stochastic game |
DocType | Volume | ISSN |
Conference | 8634 | 0302-9743 |
Citations | PageRank | References |
1 | 0.36 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathanaël Fijalkow | 1 | 61 | 19.71 |
| Hugo Gimbert | 2 | 249 | 21.31 |
| Florian Horn | 3 | 53 | 6.57 |
| Youssouf Oualhadj | 4 | 60 | 6.99 |