2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/112646Given a strongly stationary Markov chain and a finite set of stopping rules, we prove the existence of a polynomial algorithm which projects the Markov chain onto a minimal Markov chain without redundant information. Markov complexity is hence defined and tested on some classical problems.8 pages, 1 figureProbability60J22; 90C35, 94C15text