Computer Science · Theory of Computation
Which of the following languages cannot be accepted by a Pushdown Automaton (PDA)? A. L = { anbncn : n ≥ 0 } B. L = { ap : p is Prime } C. L = { wcwR : w ∈ (a,b)* } D. L = { w ∈ (a,b)* : na(w) = nb(w) } E. L = { anbmcn+m : n ≥ 0, m ≥ 0 }
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A, C & D Only
- 2B, D & E Only
- 3A & B Only✓
- 4C & D Only
Correct answer
A & B Only
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