Computer Science · Theory of Computation
When designing a DFA that accepts binary numbers whose decimal equivalent is divisible by 3, what are all the possible remainders that correspond to the states of the automaton?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 10, 1, 2, 3
- 20, 1, 2✓
- 30, 2
- 40
Correct answer
0, 1, 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