Q. 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)
Explanation:
Q. 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)
Explanation:
