Computer Science · Theory of Computation
Consider a Nondeterministic Finite Automaton (NFA) where states 1 and 2 are both initial states, and on input symbol 'a', state 1 transitions to state 1 and state 2 transitions to state 2. State 1 is the only final state. What is the number of states in the minimal Deterministic Finite Automaton (DFA) that accepts the same language?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 12✓
- 24
- 36
- 48
Correct answer
2
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