Computer Science · Theory of Computation
What is the minimum number of states required for a deterministic finite automaton (DFA) accepting the language L = {w | w ∈ {0,1}, the number of 0s and 1s in w are divisible by 3 and 5 respectively}?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 115✓
- 210
- 312
- 48
Correct answer
15
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