Abstract
In this paper the problem of automaton transformation of a discrete random process into the discrete random distribution (1/n, 1/n,…, 1/n) with any arbitrarily given accuracy is investigated. It is supposed that the properties of these input processes are not completely known, i.e., they are generated by an unstable random signal source. A class of “extremally” unstable random signal sources for which the generated random processes can still be transformed into the distribution (1/n, 1/n,…, 1/n) by an adder modulo n is introduced. An estimate of the distance between the obtained and the discrete uniform random distributions is also found, dependent on the number of operating steps of the adder, in the case when the input process is described by a finite Markov chain.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
