Computer Science · Theory of Computation
निम्नलिखित में से कौन सी समस्या अनिर्धारणीय (undecidable) है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1परिमित अवस्था स्वचालित (FSAs) के लिए समतुल्यता समस्या (Equivalence problem)
- 2परिमित अवस्था स्वचालित (FSAs) के लिए परिमितता समस्या (Finiteness problem)
- 3संदर्भ-मुक्त व्याकरण (CFGs) के लिए अस्पष्टता समस्या (Ambiguity problem)✓
- 4संदर्भ-मुक्त व्याकरण (CFGs) के लिए सदस्यता समस्या (Membership problem)
सही उत्तर देखें
संदर्भ-मुक्त व्याकरण (CFGs) के लिए अस्पष्टता समस्या (Ambiguity problem)
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