M

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

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.


Question analytics