M

Mr. Dubey • 52.30K Points
Coach 

Q. A minimum state deterministic finite automation accepting the language L = {W |W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has

(A) 15 States
(B) 11 states
(C) 10 states
(D) 9 states
Correct : Option (A)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which of the following assumptions do we make while deriving linear regression parameters? 1. The true relationship between dependent y and predictor

Q. A Use-case actor is always a person having a role that different people may play.

Q. Which of the following can determine if two masters start to use the bus at the same time?

Q. In a Hierarchical model records are organized as

Q. Which of the following is a predictive model?

Q. The most popular area of database testing is:

Q. From a group of 8 men and 6 women, five persons are to be selected to form a committee so that at least 3 women are there on the committee. In how man

Q. What is a light pen?

Q. Which of the following is relational database service provided by Amazon?

Q. Pretty good privacy (PGP) is used in ______