M

Mr. Dubey • 87.94K 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
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. If f (x) = -3x - 5, what is the value of f (2)?

Q. The parameter can assume different values which determine how the data matrix is initially processed.

Q. THE HOURS COUNTER IS IMPLEMENTED USING

Q. Which IP address is reserved for software loop-back?

Q. Application layer firewalls are also called ____________

Q. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

Q. directive specifies the end of execution of a program.

Q. SSL stands for?

Q. What is/are true about ridge regression?1. When lambda is 0, model works like linear regression model2. When lambda is 0, model doesn’t work lik

Q. The decimal equivalent of hex number 1A53 is

Question analytics