Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) Given an arbitrary non-deterministic finite automaton NFA with N states, the maximum number of states in an equivalent minimized DFA is at least:

(A) N2
(B) 2N
(C) 2N
(D) N!
Correct answer : Option (C) - 2N

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. It is possible to design a Linear regression algorithm using a neural network?

Q. Which of the following is not a feature of leadership?

Q. The read and write operations usually start at of the sector.

Q. What is incorrect about structural design?

Q. A predictive model makes use of______.

Q. SMP stands for _______________.

Q. Efficiency in a software product does not include

Q. Having built a decision tree, we are using reduced error pruning to reduce the size of the tree. We select a node to collapse. For this particular node, on the left branch, there are 3 training data points with the following outputs: 5, 7, 9.6 and for the right branch, there are four training data points with the following outputs: 8.7, 9.8, 10.5, 11. What were the original responses for data points along the two branches (left & right respectively) and what is the new response after collapsing the node?

Q. The ____________ is often employed when there is a need to use different sets of objects and where the objects could be added or changed some time during the lifetime of an application.

Q. In TDM, the transmission rate of a multiplexed path is always the sum of the transmission rates of the signal sources.