Abstract

This paper describes a stochastic model of digit transfer. The main characteristics of the transfer process are the number of transfers, the number of groups of consecutive transfers, and the maximum number of consecutive transfers. Two binary numbers with a digit transfer form a triplet, and a sequence of these triplets generates a Markov chain. In our model, the above-mentioned characteristics can be described by functionals on trajectories of this chain: the number of events, the number of runs of these events, and the maximum run length. These characteristics can be efficiently used for estimating the computation speed.

Full Text
Published version (Free)

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 call