Dimensions of random recursive sets

We prove a theorem that generalizes equality among packing, Hausdorff and upper and lower Mikowski dimensions for a general type of random recursive construction and apply it to the constructions with finite memory. Further we prove an upper bound on the packing dimension of certain random distribution funstions on $[0,1]$.