Computer Science · Theory of Computation
Which of the following is the correct statement regarding Deterministic Finite Automata (DFA) and Non-Deterministic Finite Automata (NFA)?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A DFA always has the same number of states as compared to an equivalent NFA.
- 2A DFA has fewer states as compared to an equivalent NFA.
- 3A DFA has the same or more number of states as compared to an equivalent NFA.✓
- 4A DFA has more expressive power as compared to an NFA.
Correct answer
A DFA has the same or more number of states as compared to an equivalent NFA.
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