Hi everyone,(adsbygoogle = window.adsbygoogle || []).push({});

I'm doing an investigation of markov properties and in an example I have made the following transition matrix:

http://img152.imageshack.us/img152/1584/matrixki.png [Broken]

If all the probabilities were above zero, finding the total number of possible 4-state sequences (i.e. ACBA, BACB etc.) would've been very simple. However, P(C|B)=0 (I must have at least one zero-probability option at this point) and I don't know how to find the number of total possible 4-state sequences without counting them one by one. Any help?

Thanks,

AryanK

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Total number of possible n-state sequences

Loading...

Similar Threads - Total number possible | Date |
---|---|

About the strategy of reducing the total suffering in a queue | Dec 28, 2017 |

A Combining separate upper & lower limits into a total? | Dec 8, 2016 |

Total distribution when measuring | Nov 21, 2015 |

Total number of different combination | May 21, 2014 |

Law of total probability | Apr 14, 2014 |

**Physics Forums - The Fusion of Science and Community**