In an automata or formal-language problem, which option best represents Turing machine?

Correct Answer: C

a model of computation with states, tape, head, and transition rules

In this course context, Turing machine means a model of computation with states, tape, head, and transition rules.