What is known about the Value 1 Problem for Probabilistic Automata? [article]

Nathanaël Fijalkow
<span title="2014-10-13">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The value 1 problem is a decision problem for probabilistic automata over finite words: are there words accepted by the automaton with arbitrarily high probability? Although undecidable, this problem attracted a lot of attention over the last few years. The aim of this paper is to review and relate the results pertaining to the value 1 problem. In particular, several algorithms have been proposed to partially solve this problem. We show the relations between them, leading to the following
more &raquo; ... sion: the Markov Monoid Algorithm is the most correct algorithm known to (partially) solve the value 1 problem.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1410.3770v1">arXiv:1410.3770v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5golhfw4uvekrb6eg62ehxgtci">fatcat:5golhfw4uvekrb6eg62ehxgtci</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929114346/https://arxiv.org/pdf/1410.3770v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2a/0a/2a0ae7ae40b8f48c9716859eecfc870455f31e36.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1410.3770v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>