In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”

Mr. Dubey • 52.30K Points
Coach

Q. In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”

(A) m1 is a non-deterministic finite automata

(B) m1 is a non-deterministic push-down automata

(D) for no machine m1 use the above statement true

Correct : Option (C)

Discusssion

Loading Comments....

Q. If no cycle exists in the resource allocation graph

Q. 100 people are at party. Given data gives information about how many wear pink or not, and if a man or not. Imagine a pink wearing guest leaves, what

Q. Which of the following are probalistic algorithms?

Q. print(2)

Q. In Evolutionary programming, recombination is

Q. RAYMOND'S TREE BASED ALGORITHM is an

Q. 1: When the maximum clock rate is quoted for a logic family, then it applies to a

Q. What are the exceptions which have to be handled in a RMI client program?

Q. The problem of interfacing IC logic families that have different supply voltages (VCC's) can be solved by using a:

Q. In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”

Discusssion

Related MCQs