Abstract
This research is, in a sense, a generalization of the problems of synthesis of reliable finite automata, beginning from the work of J. von Neumann (1962) . Though the final end of this work is a discussion of the problems of structural synthesis of reliable probabilistic automata, the question here will be just about the generators of probability distributions. The reason is that the synthesis of probabilistic automata can be reduced to synthesis of these generators. The method of solving this problem consists of wide use of the properties of regular bistochastic matrices. A particular case of it was successfully used by Gill (1962) in considering the problem of synthesis of probability transformers. Here, we obtain a generalization by means of some considerations from group theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.