Two strings x and y are indistinguishable if:

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K 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

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. Intersection of subgroups is a

Q. In given image, P(H|E) is probability.

Q. In the scatter operation ?

Q. Which of the following is not a kernel method in SVM?

Q. Managing of resources can be done by implementing

Q. Proof Carrying Code ...............

Q. Which of the following is the use of function in python?

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 is the probability of being a man

Q. A song being played on computer speaker is