A brand new machine starts working from unstable status (U). As time goes, it br
ID: 429429 • Letter: A
Question
A brand new machine starts working from unstable status (U). As time goes, it breaks down (B) or gets into either normal working status (N) or super good working status (S). The status of the machine follows a Markov Chain having transition matrix
(A) determine class of each state(transient or recurrent)
(B) find the expected time to exit from status U
(C)Compute the probability the machine breaks down eventually
(D) Compute the limit transition probability lim n->infinity p(n) (U,x) for each x=B,U,N,S
B U N S B 1 0 0 0 U 0.1 0.6 0.2 0.1 N 0 0 0.8 0.2 S 0 0 0.3 0.7Explanation / Answer
A.By inspection, every state is accessible from any other state, so this chain is irreducible. Therefore,
every state is recurrent.
B.025
C.0.1
D.B 0,U 0.3,N 0, S 0.2
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.