Question
What is meant by non-deterministic Turing machine in Theory of Automata and Formal Languages?
Select an option. Your answer will be checked instantly.
Correct Answer: A. a TM variant that may have multiple possible moves from a configuration
Explanation:
The correct answer is a TM variant that may have multiple possible moves from a configuration.
Leave a Reply