Question
In an automata or formal-language problem, which option best represents decidable language?
Select an option. Your answer will be checked instantly.
Correct Answer: D. a language for which some Turing machine halts on every input and decides membership
Explanation:
In this course context, decidable language means a language for which some Turing machine halts on every input and decides membership.
Leave a Reply