Space-Efficient Deterministic Simulation of Probabilistic Automata

Ioan I. Macarie
<span title="">1998</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="" style="color: black;">SIAM journal on computing (Print)</a> </i> &nbsp;
Given a description of a probabilistic automaton (one-head probabilistic nite automaton or probabilistic Turing machine) and an input string x of length n, we ask how much space does a deterministic Turing machine need in order to decide the acceptance of the input string by that automaton? The question is interesting even in the case of one-head one-way probabilistic nite automata (PFA). We call (rational) stochastic languages (S > rat ) the class of languages recognized by PFA's whose
more &raquo; ... on probabilities and cutpoints (i.e. recognition thresholds) are rational numbers. The class S > rat contains context-sensitive languages that are not context free, but on the other hand there are context-free languages not included in S > rat . Our main results are as follows:
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1137/s0097539793253851</a> <a target="_blank" rel="external noopener" href="">fatcat:afmxsmyccfd25ctwpy2mcyn6za</a> </span>
<a target="_blank" rel="noopener" href="" 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="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / </button> </a>