A constructive proof of the existence of Viterbi processes

Since the early days of digital communication, hidden Markov models (HMMs) have now been also routinely used in speech recognition, processing of natural languages, images, and in bioinformatics. In an HMM $(Xi,Yi){i\ge 1}$, observations $X1,X2,...$ are assumed to be conditionally independent given an ``explanatory'' Markov process $Y1,Y2,...$, which itself is not observed; moreover, the conditional distribution of $Xi$ depends solely on $Yi$. Central to the theory and applications of HMM is the Viterbi algorithm to find {\em a maximum a posteriori} (MAP) estimate $q{1:n}=(q1,q2,...,qn)$ of $Y{1:n}$ given observed data $x_{1:n}$. Maximum {\em a posteriori} paths are also known as Viterbi paths or alignments. Recently, attempts have been made to study the behavior of Viterbi alignments when $n\to \infty$. Thus, it has been shown that in some special cases a well-defined limiting Viterbi alignment exists. While innovative, these attempts have relied on rather strong assumptions and involved proofs which are existential. This work proves the existence of infinite Viterbi alignments in a more constructive manner and for a very general class of HMMs.