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. A minimum state deterministic finite automaton accepting the language L={w | w ε {0,1} *, number of 0s and 1s in w are divisible by 3 and 5, respectively} has
a. 15 states
b. 11 states
c. 10 states
d. 9 states
Answer:15 states

Similar Questions:



View All Questions on: Theory of Computation(TOC)


Start The Conversation: