Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K 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. A regression test

Q. A thread is also called

Q. includes tools for process modeling and many of the process-enabling technologies such as business rules, policies, and metrics.

Q. Which of the following are NOT Relational operators in C#.NET? 1.>= 2.!= 3.Not 4.<= 5.<>=

Q. What is the GCD according to the given Venn Diagram?

Q. Which of the following stage is present in FM receiver but not in AM receiver?

Q. ECL was invented in by

Q. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

Q. Which of the following expressions is in the sum-of-products form?

Q. Which of the following statements is NOT true concerning VPNs?