Computer Science · Theory of Computation
Match List-I with List-II according to the Chomsky Hierarchy: List-I A. Type-0 grammar B. Type-1 grammar C. Type-2 grammar D. Type-3 grammar List-II I. Linear Grammar II. GNF (Greibach Normal Form) III. x → y, where |x| ≤ |y|; x, y ∈ (V ∪ T) IV. Recursively Enumerable Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - I, B - II, C - III, D - IV
- 2A - II, B - I, C - III, D - IV
- 3A - III, B - II, C - IV, D - I
- 4A - IV, B - III, C - II, D - I✓
Correct answer
A - IV, B - III, C - II, D - I
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation