Question
In an automata or formal-language problem, which option best represents unrestricted grammar?
Select an option. Your answer will be checked instantly.
Correct Answer: B. a grammar type powerful enough to generate recursively enumerable languages
Explanation:
In this course context, unrestricted grammar means a grammar type powerful enough to generate recursively enumerable languages.
Leave a Reply