In this paper we describe an algorithm for producing infinitely many examples of set-theoretic complete intersection monomial curves in Pn+1, starting with a single set-theoretic complete intersection monomial curve in P-n. Moreover we investigate the numerical criteria to decide when these monomial curves can or cannot be obtained via semigroup gluing.
