Question
What is meant by decidable language in Theory of Automata and Formal Languages?
Select an option. Your answer will be checked instantly.
Correct Answer: A. a language for which some Turing machine halts on every input and decides membership
Explanation:
The correct answer is a language for which some Turing machine halts on every input and decides membership.
Leave a Reply