1. A. A. Markov, “Example of Statistical Investigations of the Text of “Eugen Onegin,” which Demonstrates the Connection of Events in a Chain,” in Bulletin de l’Académie Impériale des Sciences de St.-Pétersbourg (Sankt-Petersburg, 1913), pp. 153–162 [in Russian].
2. L. Baum, T. Petrie, G. Soules, and N. Weiss, “A Maximization technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains,” Ann. Math. Statist. 41, pp. 164–171 (1970).
3. A. Viterbi, “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm,” IEEE Trans. on Information Theory 13, 260–269 (1967).
4. B. Lowerre and D. Reddy, “The Harpy Speech Understanding System,” in Trends in Speech Recognition, Ed. by W. Lea (Englewood Cliffs, Prentice-Hall Inc., New Jersey, 1980), pp. 340–360.
5. L. R. Rabiner, “A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition,” in Proceedings of the IEEE, 1989, vol. 77, no. 2, pp. 257–286.