Question
In an automata or formal-language problem, which option best represents recognizable language?
Select an option. Your answer will be checked instantly.
Correct Answer: A. a language accepted by a Turing machine that may not halt on non-members
Explanation:
In this course context, recognizable language means a language accepted by a Turing machine that may not halt on non-members.
Leave a Reply