Computer Science · Theory of Computation
Which of the following languages requires a 2-stack Pushdown Automaton (PDA) and cannot be accepted by a 1-stack PDA?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1{ anbn | n ≥ 0 }
- 2{ wwR | w ∈ {a, b}* }
- 3{ anbncn | n ≥ 0 }✓
- 4{ w ∈ {a, b}* | number of a's equals number of b's }
Correct answer
{ anbncn | n ≥ 0 }
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