Computer Science · Theory of Computation
Match List I with List II: List I (Grammar Type) (A) Type 0 (B) Type 1 (C) Type 2 (D) Type 3 List II (Automata) (I) Finite automata (II) Turing machine (III) Linear bounded automata (IV) Pushdown automata Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(A) - (III), (B) - (IV), (C) - (II), (D) - (I)
- 2(A) - (II), (B) - (III), (C) - (IV), (D) - (I)✓
- 3(A) - (III), (B) - (IV), (C) - (I), (D) - (II)
- 4(A) - (II), (B) - (III), (C) - (II), (D) - (IV)
Correct answer
(A) - (II), (B) - (III), (C) - (IV), (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