Concentration inequalities are very often a crucial step in deriving many results in statistical learning. The purpose of this talk is to present exponential and polynomial tail maximal inequalities for regenerative Markov chains. All constants involved in the bounds are