Question

Prove that the language L={(M, N): M is a Turing machine and N is a DFA with L(M) =L(N)} is undecidable. You need to derive a reduction from Atm={(M, w)|Turing machine M accepts w} to L.

(In layman's terms please, no other theorems involved)

Answer 1

I don't know l will tell you tomorrow morning at the end of the day