A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 whosedoi:10.1137/s0097539793253851 fatcat:afmxsmyccfd25ctwpy2mcyn6za