Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2002 | Question 38

  • Last Updated : 20 May, 2017

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

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :