Question
In an automata or formal-language problem, which option best represents Turing machine?
Select an option. Your answer will be checked instantly.
Correct Answer: C. a model of computation with states, tape, head, and transition rules
Explanation:
In this course context, Turing machine means a model of computation with states, tape, head, and transition rules.
Leave a Reply