Question
In an automata or formal-language problem, which option best represents halting state?
Select an option. Your answer will be checked instantly.
Correct Answer: A. a state in which a Turing machine stops computation
Explanation:
In this course context, halting state means a state in which a Turing machine stops computation.
Leave a Reply