Modify the Baum-Welch algorithm given in Appendix A (c15 bwa.m) so that one does not have to enter initial guesses for the matrices A, B, and π. Make the elements of A and B random but reasonable.
(For example, the ondiagonal elements of the A matrix are typically larger than the off-diagonal terms.) For the initial π matrix make all values equal. Test your resulting program by reworking Example several times. What do you observe?