GATE | GATE-CS-2002 | Question 38

The smallest finite automation which accepts the language {x | length of x is divisible by 3} has :

(A) 2 states
(B) 3 states
(C) 4 states
(D) 5 states

Answer: (B)

Thus, we require 3 states.

So, B is the correct choice.

Please comment below if you find anything wrong in the above post.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.