I have a question for my automata class and I wanted to run it by anyone who may know. The question is if A is mapping reducible to B and B is known to be regular does it imply that A is also regular?
I say that it does, because if A can in fact be solved by B and it is known to be regular, then A must be recognizable as well because if B can recognize it then surely a TM can be written to recognize A.
I say that it does, because if A can in fact be solved by B and it is known to be regular, then A must be recognizable as well because if B can recognize it then surely a TM can be written to recognize A.
