PS22 - Hidden Markov Models - Part 4 - Hidden Markov Models (Decoding Problem and Viterbi Algorithm)

Please go through the Rabiner paper and Summary of HMMs (Section A.4) to identify what is the Decoding problem, computing hidden state sequence from a HMM, evaluating different hidden states for a given observable sequence, using brute force method to evaluate multiple paths, why brute force is computationally infeasible, what makes this problem a candidate for dynamic programming solution, and finally how to apply viterbi algorithm to determine the best hidden path sequence that explains this data from this model.