Regenerative stopping problems are stopping problems which recommence from the initial state upon stopping. An algorithm is presented which solves semi-Markov regenerative stopping problem with a finite number of continue actions by solving a sequence of stopping problems. New results for the optimal stopping problem are obtained as well as for the regenerative stopping problem. A model in the literature is used as a detailed example of the algorithm.