Question

Acc
Prove that the language L={(M, N): Mis 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.
​

Answer 1

Answer:

the answer is very simple see