How can a Turing Machine recognize a regular language? This is a practice problem for a midterm in a class I'm taking:


  Given a regular language $L$, describe formally a Turing machine that recognize $L$. 


I'm not sure how I should do that.
Hint: A DFA consists of 5 parts: state-set, alphabet, initial-state, final-state-set and transition-function. What does a Turing Machine consist of, and which would correspond to each part of a DFA?