Computer Science · Theory of Computation
Consider the Language L = { w ∈ {a, b}* | |w| is divisible by 2 or 3, but not both }. The minimum number of states and the number of final states required in a Deterministic Finite Automaton (DFA) accepting L are respectively:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 17 and 3
- 27 and 4
- 36 and 4
- 46 and 3✓
Correct answer
6 and 3
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