A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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:3 states
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: