M

Mr. Dubey • 52.30K Points
Coach 

Q. Which one of the following is FALSE?

(A) There is unique minimal DFA for every regular language
(B) Every NFA can be converted to an equivalent PDA.
(C) Complement of every context-free language is recursive.
(D) Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
Correct : Option (D)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The reason for separating the use-case realization from its use case is ________________.

Q. Which of the following is the most refined and restrictive service model?

Q. The open and create system calls returns an integer called a ……….

Q. Resource management includes

Q. What is a top-down parser?

Q. Concept of software engineering is applicable to

Q. Which of the following storage devices can store maximum amount of data?

Q. Mealy machines have states than Moore machine.

Q. Regression testing should be tightly linked to _________, and be built from the successful test cases developed and used in it.

Q. A grid is comprised of ________ of threads.