This paper deals with characterizations for the distributional regeneration of general Markov chains. In particular, we formulate sufficient conditions for the positive recurrence in terms of matrix representations and minorization conditions. As examples we study the distributional regeneration of shifts on a finite alphabet and ergodic S-unimodal interval maps.