Consider the following transition graph of a discrete Markov chain with four states.

1. If the system is in state 4 at time n, what is the probability it will be in state 4 at time n + 4 

2. The continuous unreliable machine: (choose one)

- Is not an ergodic system.

- Only has an approximate steady-state solution because little o is unknown.

- Has been analyzed to give a didactic example on how to calculate the transition equations, time-transient solutions, and steady-state solutions.-

Transcribed Image Text:

0.3 0.2 1 2 0.4 PA1 0.7 4 0.6 0.4 0.6 3. 0.3 0.2 1 2 0.4 PA1 0.7 4 0.6 0.4 0.6 3.