Introduces Hidden Markov Models, explaining the basic problems and algorithms like Forward-Backward, Viterbi, and Baum-Welch, with a focus on Expectation-Maximization.
Explores the marriage problem, modeling the process as a controlled stochastic process with dynamic programming algorithms to find the optimal policy for accepting bachelors.