Question
What is meant by unrestricted grammar in Theory of Automata and Formal Languages?
Select an option. Your answer will be checked instantly.
Correct Answer: A. a grammar type powerful enough to generate recursively enumerable languages
Explanation:
The correct answer is a grammar type powerful enough to generate recursively enumerable languages.
Leave a Reply