M

Mr. Dubey • 85.25K Points
Coach 

Q. Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

(A) 3
(B) 5
(C) 8
(D) 9
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. Suppose you have designed two versions of your application and you show themto a set of 10 users one by one for a user study. Which of the following s

Q. Which of the following is not a messaging mode in CoAP?

Q. Which type of graph has no odd cycle in it?

Q. New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.

Q. Which of the following does not affect the size of the SGA?

Q. In the FSM diagram, what does arrow between the circles represent?

Q. Which of the following businesses benefit and implemented RFID?

Q. Iterative development is NOT a good idea for?

Q. The S-R, J-K and D inputs are called

Q. A logical schema

Question analytics