Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.47K Points
Coach 

Q.) Two strings x and y are indistinguishable if:

(A) δ*(s, x) = δ* (s, y), i.e. the state reached by a DFA M on input x is the same as the state reached by M on input y
(B) if for every string z Є ∑* either both xz and yz are in language A on ∑* or both xz and yz are not in A
(C) Both above statements are true
(D) None of the above
Correct answer : Option (C) - Both above statements are true

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. A tablespace is further broken down into

Q. Resident is an individual who has resided in India for a period or periods amounting in all to days or more in the twelve months immediately preceding the date of application for Aadhaar Enrolment/Update.

Q. Which of the following option is not considered by the Interface design?

Q. The is represented as two processing boxes connected by an line (arrow) of control.

Q. What is the normal order of activities in which traditional software testing is organized? a. Integration testing b. System testing c. Unit testing d. Validation testing

Q. Signals can be analog or digital and a computer that processes the both type of signals is known as

Q. Which of these comes under business activities?

Q. Control function of management cannot be performed without:

Q. An investment project costs P. It is expected to have an annual net cash flow of 0.125P for 20 years. What is the project’s payback period?

Q. For implementation of PROM, which IC is used?