Two Recursively Inseparable Problems for Probabilistic Automata
Formal Languages and Automata Theory
2017-09-12 v1
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.
Keywords
Cite
@article{arxiv.1709.03122,
title = {Two Recursively Inseparable Problems for Probabilistic Automata},
author = {Nathanaël Fijalkow and Hugo Gimbert and Florian Horn and Youssouf Oualhadj},
journal= {arXiv preprint arXiv:1709.03122},
year = {2017}
}
Comments
Conference version: MFCS'14