This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Relationships Among Distinct Models and Notions of Equivalence for Stochastic Finite-State Systems
July 1969 (vol. 18 no. 7)
pp. 633-641
In an effort to relate various existent schools of thought, this paper describes four models of probabilistic finite-state systems, giving necessary and sufficient conditions for reciprocal describability. An algorithm for the realization (synthesis) of a stochastic sequential machine by a deterministic machine and additive noise is presented. Different definitions of equivalence are listed and related by theorems, the most important of which states that "behavioral equivalence" with the same cutpoints for sequence recognizers is identical to "stochastic equivalence" (indistinguishability) for sequence transducers. Corollaries show the import of these results to the state minimization problem. The paper composes a strong case in favor of the adoption of J. W. Carlyle's model as a unifying one.
Index Terms:
Additive noise, deterministic machine, finite state-systems, sequence recognizers, sequence transducers, state minimization, stochastic equivalence, stochastic sequential.
Citation:
C. De Renna E, R.J. Leake, "Relationships Among Distinct Models and Notions of Equivalence for Stochastic Finite-State Systems," IEEE Transactions on Computers, vol. 18, no. 7, pp. 633-641, July 1969, doi:10.1109/T-C.1969.222730
Usage of this product signifies your acceptance of the Terms of Use.