Computer Science · Theory of Computation
निम्नलिखित ऑटोमेटा अवधारणाओं को उनकी सही विशेषताओं के साथ सुमेलित करें: P. DFA Q. ε-NFA R. NFA से DFA परिवर्तन S. नियमित भाषाएं (Regular languages) विशेषताएं: i. ε-संक्रमण (बिना इनपुट उपभोग) की अनुमति देता है ii. नियतात्मक और अनियतात्मक दोनों परिमित ऑटोमेटा द्वारा स्वीकार्य iii. केवल नियतात्मक संक्रमण (Deterministic transitions) iv. उपसमुच्चय निर्माण (Subset construction) विधि
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1P-ii, Q-i, R-iii, S-iv
- 2P-i, Q-iii, R-ii, S-iv
- 3P-iv, Q-ii, R-i, S-iii
- 4P-iii, Q-i, R-iv, S-ii✓
सही उत्तर देखें
P-iii, Q-i, R-iv, S-ii
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