Question
What is meant by undecidable problem in Theory of Automata and Formal Languages?
Select an option. Your answer will be checked instantly.
Correct Answer: D. a decision problem for which no algorithm halts with correct yes/no answers for all inputs
Explanation:
The correct answer is a decision problem for which no algorithm halts with correct yes/no answers for all inputs.
Leave a Reply