Let K and L be two languages over (Sigma ) and (Gamma ) (with (Gamma subset Sigma )), respectively. Then, the L-reduction of K, denoted by (K%,L), is defined by ({ u_0u_1cdots u_n in (Sigma - Gamma )^* mid u_0v_1u_1 cdots v_nu_n in K, v_i in L (1le i le n) }). This is extended to language classes as follows: ({mathcal {K}}% {mathcal {L}}={K%L mid K in {mathcal {K}}, , L in {mathcal {L}} }). In this paper, we investigate the computing powers of (mathcal {K}%,mathcal {L}) in which (mathcal {K}) ranges among various classes of (mathcal {INS}^i_{!!j}) and min-(mathcal {LIN}), while (mathcal {L}) is taken as (mathcal {DYCK}) and (mathcal {F}), where (mathcal {INS}^i_{!!j}): the class of insertion languages of weight (j, i), min-(mathcal {LIN}): the class of minimal linear languages, (mathcal {DYCK}): the class of Dyck languages, and (mathcal {F}): the class of finite languages. The obtained results include: