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.”

Home / Engineering / Theory of Computation / Question

Mr. Dubey • 51.32K 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 answer : Option (C) - m1 is a non-deterministic turing machine

Discusssion

Related MCQs on Theory of Computation

Q. What type of logic circuit is represented by the figure shown below?

Q. Change in output of sensor with change in input is

Q. Relations produced from an E-R model will always be in

Q. Which operating system doesn't support networking between computers?

Q. In some programming languages, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denotes the set of letters and digit respectively. Which of the following expression defines an identifier?

Q. What is a virtual server platform that allows users to create and run virtual machines on Amazon’s server farm.

Q. The Hadoop list includes the HBase database, the Apache Mahout system, and matrix operations.

Q. Fiscal Policy means:

Q. The management information system (MIS) structure with one main computer system is called a

Q. A GAL is essentially a .