Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.47K 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
Correct answer : Option (D) - 9

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. The number of edges from the root to the node is called of the tree.

Q. What is the value of the following Python expression? bin(0x8)

Q. Loss of power and unauthorized change in the functional unit of hardware comes under problems and issues of the physical layer.

Q. What are the advantages of file replication?

Q. Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.

Q. PSTN stands for

Q. All deadlocks involve conflicting needs for

Q. Suppose you are using RBF kernel in SVM with high Gamma value. What does this signify?

Q. Reading data is performed in magnetic disk by

Q. The record of outcomes produced on a specific job function or activity during a specific time period is called