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. Which of the following in Object Oriented Programming is supported by Function overloading and default arguments features of C++?

Q. Which of the folllowing is an example of feature extraction?

Q. The term that is not associated with data cleaning process is____________.

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

Q. In the PL/SQL block below, how many rows will be inserted in the messages table? DECLARE v_start_salesNUMBER := 2; v_end_sales NUMBER := 100; BEGIN FO

Q. The type of signaling used in RAMBUS is

Q. In paged memory systems, if the page size is increased, then the internal fragmentation generally

Q. Which of the following is not correct for virtual function in C++?

Q. Appointing someone on a post that is at same wages/rank refers to

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