Define a mapping reduction f from ALLtm to C and show that fiscompatible.?

Let C = {%26lt;D,M%26gt; | D is a finite automaton, M is a Turing machine, and L(D) ⊆ L(M)}.





Recall that ALLtm is the set of all %26lt;M%26gt; such that M is a Turing machine and M accepts all inputs.





Define a mapping reduction f from ALLtm to C and show that fiscompatible.

Define a mapping reduction f from ALLtm to C and show that fiscompatible.?
if you have any questions, email me =]
Reply:Construct a turing machine K(D,M) which


if w is not in L(D), halt and accept


if w is in L(M), halt and accept


otherwise loop.





K(D,M) accepts all strings iff L(D) is a subset of L(M).





you have to define compatible for me.