Computer Science · Theory of Computation
निम्नलिखित में से कौन सी भाषा एक पुशडाउन ऑटोमेटा (PDA) द्वारा स्वीकार नहीं की जा सकती है? A. L = { anbncn : n ≥ 0 } B. L = { ap : p अभाज्य है } 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:
- 1केवल C और D
- 2केवल A और B✓
- 3केवल B, D और E
- 4केवल A, C और D
सही उत्तर देखें
केवल A और B
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
Preparing for Computer Science?
Practice full-length Computer Science 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