Let n be the positive integer constant and L be the language with alphabet {a}. To recognize L the minimum number of states required in a DFA will be

Mr. Dubey • 52.30K Points
Coach

Q. Let n be the positive integer constant and L be the language with alphabet {a}. To recognize L the minimum number of states required in a DFA will be

(A) 2k + 1

(B) k + 1

(D) n + 1

Correct : Option (D)

Discusssion

Be the first to start discuss.

Q. Which of the following software can be used to implement load balancing?

Q. A small or intelligent device is so called because it contains within it a

Q. RAD Model has

Q. Buffering is done to

Q. Bytes of data being transferred in each connection are numbered by TCP. These numbers start with a _________

Q. Because the kernel thread management is done by the Operating System itself

Q. To what does the ISO 9000 standards family apply?

Q. The complexity of the average case of an algorithm is

Q. is an extension of the processor BUS.

Q. Let n be the positive integer constant and L be the language with alphabet {a}. To recognize L the minimum number of states required in a DFA will be

Discusssion

Related MCQs