Skip to main content
Article thumbnail
Location of Repository

Two Recursively Inseparable Problems for Probabilistic Automata

By Nathanaël Fijalkow, Hugo Gimbert, Florian Horn and Youssouf Oualhadj


International audienceThis 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

Topics: [ INFO.INFO-GT ] Computer Science [cs]/Computer Science and Game Theory [cs.GT]
Publisher: HAL CCSD
Year: 2014
OAI identifier: oai:HAL:hal-01007706v1
Provided by: Hal-Diderot

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.