On the operations of bounded suffix summation and multiplication

The operations of bounded suffix summation and bounded suffix multiplication are introduced. Using these operations, we define the class BSSM of polynomially computable functions. It is proved that the class BSSMcontains the class BPC defined by the operation of bounded prefix concatenation and has finite basis under superposition.