Design a TM M that decides ADFA
M ="on input <B,w>, where B is a DFA and w is a string:
1. Simulate B on input w.
2. If the simulation ends in an accept state, accept. If it ends in a non-accepting state, reject."
You could write a computer program to do so
First examine the input <B, w>
How to represent B, a reasonable DFA?
W, a valid string?
M rejects if the input <B,w> doesn't properly represent a DFA B and a string w.
Second, M carries out the simulation
Start from B's start state and w's leftmost symbol
M keeps track of B's current state and B's position in the input w by writing on its tape.
When M finishes processing the last symbol of w, accepts the input if B is an accepting state, otherwise, rejects.