determine the period of state 0 in the markove chain whose t

Solution

It is possible to go from states 0 1 2 3 0, which is a period of 4.

It is also possible to go from states 0 1 2 3 4 0, which is a period of 5.

Since these periods are relatively prime, the chain is aperiodic.

11 is the largest n for which it is not possible to return to state 0 in n steps.