In an automata or formal-language problem, which option best represents unrestricted grammar?

Correct Answer: B

a grammar type powerful enough to generate recursively enumerable languages

In this course context, unrestricted grammar means a grammar type powerful enough to generate recursively enumerable languages.