Question

87 A ceatain calculating machine uses only the digits o and I. It is supposed to transmit one of these digits through several stages. However, at every stage, there is a probability þ that the digit that enters will be changed when it leaves and a probability 2-1- that it won't. Form a Markov chain to represent the process of transmission by taking as states the digits 0 and 1. What is the probability that the machine, after two stages produces the digit o. (i.e., the correct dight) ?

Answer 1

Gtuen thot ta cctel comfa tco dHfexent Penkaa A andorfzed d hhisk Pogecm amarg utren psetam dey. The Proome diffes n rtarsty edaa rteetan SOMhon (9/s5- 0.2188- o.2969 feserce o.oS8 18/65 O-88 P,(1-FiPCi-pe) P-P d.2-o.8 - (1.96 a12 Ko. 48 +o.2 xo15 G5 - o-06t o.I544 oaes bound -o.814 uRpe baund -0.094 adf RaRoCa*u)/ (ua) a.728 Cs Scanned with CamScanner