We consider discretized piecewise-monotone-increasing Markov transformations and give an algorithm, called the bounded monotone truth-table algorithm, for generating all full-length sequences which are based on the discretized transformations. The algorithm is efficient in the sense that it guarantees to generate all full-length sequences without computing their total number. Additionally it is applicable to generation of all de Bruijn sequences.