I'm asked to choose a DFA and convert it to NFA and then convert it to Turing machine... I have done the first two parts as follows:   DFA:--> NFA:--> Turing machine:???I haven't found any explanation/tutorial on how to do this. So, a final solution containing a state diagram with an explanation on what steps were followed would be great.
Converting this NFA to Turing Machine
turing machines;finite automata;nondeterminism;simulation