Beginner
Theory of Computation
Q12 / 100
What is the Chomsky hierarchy?
Correct! Well done.
Incorrect.
The correct answer is B) A classification of formal languages into four types: regular, context-free, context-sensitive, and recursively enumerable
B
Correct Answer
A classification of formal languages into four types: regular, context-free, context-sensitive, and recursively enumerable
Explanation
Chomsky Type 3 (regular) ⊂ Type 2 (context-free) ⊂ Type 1 (context-sensitive) ⊂ Type 0 (recursively enumerable). Each type is recognized by a progressively more powerful automaton.
Progress
12/100