Proof that Finite Turing Machine is reducible to Regular Turing Machine

315 Views Asked by At

I know that Finite Turing Machine and Regular Turing Machine are undecidable through Rice's theorem, but I may find a reduction among them?

Finite TM = {< M > | L(M) is finite on {a}}

Regular TM = {< M > | L(M) is regular on {a,b}}