The most informative stopping times for Viterbi algorithm: sequential properties

Sequential properties of the Viterbi algorithm are studied based on a renewal sequence of the most informative stopping times which can be explicitly found during the Viterbi recognition of the most likeliest hidden Markovian state-sequence.