GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 31
How many states are required in a DFA to accept a binary string, whose decimal equivalent is divisible by 32 ?
(A) 5
(B) 6
(C) 32
(D) 33
Answer: (B)
Explanation: It can easily be made, by treating it like mod machine having mod equals to 0.
Option (B) is correct.
Quiz of this Question
Last Updated :
06 Jan, 2020
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...