Computer Science · Theory of Computation
भाषा पहचान शक्ति के संदर्भ में, डिटरमिनिस्टिक पुशडाउन ऑटोमेटा (DPDA) और नॉन-डिटरमिनिस्टिक पुशडाउन ऑटोमेटा (NPDA):
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1सीमित मेमोरी रखते हैं
- 2रेगुलर भाषाओं को स्वीकार नहीं कर सकते
- 3समान नहीं (not equivalent) हैं✓
- 4समान (equivalent) हैं
सही उत्तर देखें
समान नहीं (not equivalent) हैं
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