By Topic

Relationships Among Distinct Models and Notions of Equivalence for Stochastic Finite-State Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-18 ,  Issue: 7 )