203 views
0 votes
0 votes
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??

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Rajesh R asked Dec 20, 2017
299 views
If a problem A is reducable to problem B and it is known that B is undecidable then is A undecidable?