Question
In an automata or formal-language problem, which option best represents non-deterministic Turing machine?
Select an option. Your answer will be checked instantly.
Correct Answer: C. a TM variant that may have multiple possible moves from a configuration
Explanation:
In this course context, non-deterministic Turing machine means a TM variant that may have multiple possible moves from a configuration.
Leave a Reply