Generalized Cantor functions: random function iteration

We provide a generalization of the classical Cantor function. One characterization of the Cantor function is generated by a sequence of real numbers that starts with a seed value and at each step randomly applies one of two different linear functions. The Cantor function is defined as the probability that this sequence approaches infinity. We generalize the Cantor function to instead use a set of any number of linear functions with integer coefficients. We completely describe the resulting probability function and give a full explanation of which intervals of seed values lead to a constant probability function value.