Showing papers on "Probabilistic analysis of algorithms published in 1969"
TL;DR: In this paper, a mapping induced by a PGSM-mapping is introduced and is shown to be one of the operations which preserve a probabilistic event.
Abstract: A probabilistic event is a fuzzy set of tapes accepted by a finite probabilistic automation. In this paper, a mapping induced by a PGSM-mapping is introduced and is shown to be one of the operations which preserve a probabilistic event. Using mappings induced by a GSM-mapping, some recursively unsolvable problems with respect to rational finite probabilistic automata are studied.
22 citations
TL;DR: By applying the algorithm for testing the linearity of a probabilistic sequential machine to the 2-adic automaton, it is shown that there are linear probabilism automata, which can accept non-regular events.
Abstract: Based on the notion of a stochastic matrix operator, the class of linear probabilistic sequential machines is defined and characterized. Necessary and sufficient conditions are formulated for a given probabilistic sequential machine to be linear. An algorithm for testing the linearity of a probabilistic sequential machine is presented as well. By applying this algorithm to the 2-adic automaton, it is shown that there are linear probabilistic automata, which can accept non-regular events.
3 citations