Posted by **Sally** on Sunday, February 15, 2009 at 10:10am.

A machine is either working (state 1) or not workind (state 2). If it is working one day the probability that it will be broken the next day is 0.1. If it is not working one day the probability that it will be working the next day is 0.8. Let Tn be the state of the machine n days from now. Assume the Markov assumption is satisfied so that Tn is a Markov Chain.

a) Give the transition matrix P for T.

## Answer This Question

## Related Questions

- math - A machine is either working (state 1) or not workind (state 2). If it is ...
- Markov chains - A company has 2 machines. On any day, each machine that is ...
- linear algebra - The weather on any given day in a particular city can be sunny...
- Math- probability - In a city, every day is either cloudy or sunny (not both). ...
- discrete probability distribution (help please!) - a machine has 7 identical ...
- statistics - A widget factory's worker productivity is normally distributed. one...
- math - A machine has four components, A, B, C, and D, set up in such a manner ...
- Elementary Statistics - A machine has 7 identical components which function ...
- stat - a machine has 7 identical components which function independently. the ...
- Math - It takes one man one day to dig a 2m x 2m x 2m hole. How long does it ...

More Related Questions