Suppose I have given a problem and I need to prove that problem to be regular or say CFL then is it a wrong approach that if I reduce a problem to a CFL or non CFL and claim that the original language is also CFL or non CFL respectively ?
According to me it's wrong approach because say I reduce a problem to a non CFL then it implies that the original problem may be non CFL but doesn't guarantee to be non CFL.
Right??