# 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.

• What have you tried? Where did you get stuck? What other models do you know of that can accept regular languages, and how could you simulate them with a Turing Machine? Jul 29, 2013 at 20:02
• My ideal is since every regular language has a DFA..so, the problem is how Turing Machine simulates DFA? Am I right? Jul 29, 2013 at 20:08
• That's right. Now, 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? Jul 29, 2013 at 21:37
• I solved it..really appreciated it.. Jul 29, 2013 at 21:46
• @user67584 You should add your answer here, both for review and for later visitors.
– Raphael
Jul 30, 2013 at 10:27

$L$ is regular and so accepting by a dfa. for each transition $\delta(p,a)=q$ in the dfa accepting $L$ let $\delta(p,a)=(q,a,R)$ for define a TM which accepting $L$.