Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.43K Points
Coach 

Q.) Which of the following conversion is not possible (algorithmically)?

(A) regular grammar to context-free grammar
(B) non-deterministic finite state automata to deterministic finite state automata
(C) non-deterministic pushdown automata to deterministic pushdown automata
(D) none deterministic turing machine to deterministic turing machine
Correct answer : Option (B) - non-deterministic finite state automata to deterministic finite state automata

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. AMI (Amazon Machine Image) imaging service is provided by Amazon for

Q. Which of the following is not a stable sorting algorithm in its typical implementation.

Q. What is Neuro software?

Q. Which command is used to save the standard output in a file, as well as display it on the terminal?

Q. Which of the following statements is not true?

Q. Let’s say, a “Linear regression” model perfectly fits the training data (train error is zero). Now, Which of the following statement is true?

Q. Agility is nothing more than the ability of project team to respond rapidly to change.

Q. Magnetic Disks are often called

Q. What is the least time in which we can raise a number x to power y?

Q. Which of the following is not a SQA plan for a project?