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.17K 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. The address system supported by ARM systems is/are

Q. The addresses of class C network has subnet mask of .

Q. A system that does not interact with external environment is called

Q. Which prioritization technique is used when we assign equal importance to ‘probability of occurrence’ and ‘Impact of problem’ in risk matrix?

Q. The IA-32 processor can switch between 16 bit operation and 32 bit operation with the help of instruction prefix bit.

Q. A network router joins two _________ together?

Q. The completeness constraint may be one of the following: Total generalization or specialization, Partial generalization or specialization. Which is the default?

Q. Which of the following as an assumption of an LP model

Q. Data flow testing is a control structure testing technique where the criteria used to design test cases is that they

Q. Which one of the following is the strongest correct statement about a finite language Lover a finite alphabet Σ?