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.
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community