Computer Science · Theory of Computation
Match the following language families with their corresponding accepting automata: I. Unrestricted language 1. Finite automata II. Context-sensitive language 2. Pushdown automata III. Context-free language 3. Linear bounded automata IV. Regular language 4. Turing machine
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1I - 2; II - 3; III - 4; IV - 1
- 2I - 4; II - 2; III - 1; IV - 3
- 3I - 3; II - 4; III - 1; IV - 2
- 4I - 4; II - 3; III - 2; IV - 1✓
Correct answer
I - 4; II - 3; III - 2; IV - 1
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