What is meant by Chomsky hierarchy in Theory of Automata and Formal Languages?

Correct Answer: A

the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes

The correct answer is the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes.