We provide a general framework for computing upper bounds on mixing times of finite Markov chains when its minimal ideal is left zero. Our analysis based combining results by Brown and Diaconis with our previous work stationary distributions chains. Stationary can be computed from the Karnofsky--Rhodes McCammond expansion right Cayley graph semigroup underlying chain. Using loop graphs, which a...