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
Article Tags :
Recommended Articles