Computer Science · Theory of Computation
निम्नलिखित में से कौन सी भाषा खाली स्टैक स्वीकृति (empty stack acceptance) का उपयोग करके एक पुशडाउन ऑटोमेटा (PDA) द्वारा स्वीकार की जा रही है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1{anbn | n ≥ 1}✓
- 2{anbncn | n ≥ 1}
- 3{ww | w ∈ {a, b}}
- 4{anbm | n ≠ m}
सही उत्तर देखें
{anbn | n ≥ 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