Two Recursively Inseparable Problems for Probabilistic Automata

@inproceedings{Fijalkow2014TwoRI,
  title={Two Recursively Inseparable Problems for Probabilistic Automata},
  author={Nathana{\"e}l Fijalkow and Hugo Gimbert and Florian Horn and Youssouf Oualhadj},
  booktitle={MFCS},
  year={2014}
}
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… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Probabilistic ω-automata

Christel Baier, Nathalie Bertrand, Marcus Größer
Journal of the ACM, • 2012
View 5 Excerpts
Highly Influenced

Algorithms for omega-regular games of incomplete information

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
Logical Methods in Computer Science, • 2007
View 1 Excerpt

Digital images and formal languages

Handbook of Formal Languages • 1997
View 1 Excerpt

Finite-State Transducers in Language and Speech Processing

Computational Linguistics • 1997
View 1 Excerpt

Lipton . On the complexity of space bounded interactive proofs ( extended abstract )

Anne Condon, J. Richard
Foundations of Computer Science • 1989

Similar Papers

Loading similar papers…