Threshold Logic Elements Used as a Probability Transformer
Journal of the ACM (JACM)
On a measure of complexity for stochastic sequential machines
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
State-calculable stochastic sequential machines, equivalences, and events
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
| Hi-index | 14.98 |
A new model for stochastic sequential machines is introduced. This model consists of a deterministic Mealy-type synchronous sequential machine some of whose inputs are random number generators while the outputs of another set of random number generators are used to perturb the output function of the deterministic Mealy machine. Thus this model is physically realizable in terms of random number generators, logic and memory elements. It is shown that this model and the Shannon model of a stochastic sequential machine are coextensive and a procedure is given, through a proof of this result, for obtaining one from the other. The model given here is then compared with the realizable model introduced by Nieh and Carlyle [1] and it is shown that their model and ours may be realized with identical random number generators for the case of input-state calculable stochastic sequential machines.