Question: Q5. Consider a language L over the binary alphabet. For any two binary strings x, y we say x, y are distinguishable by L if
Q5.
Consider a language L over the binary alphabet. For any two binary strings x, y we say x, y are distinguishable by L if there exists a string w L such that exactly one of the strings xw, yw is in L. x, y are indistinguishable by L otherwise (denoted by idL. Prove that idL is an equivalence relation.

5. Consider a language L over the binary alphabet. For any two binary strings x,y we say x,y are distinguishable by L if there exists a string wL such that exactly one of the strings xw,yw is in L.x,y are indistinguishable by L otherwise (denoted by idL. Prove that idL is an equivalence relation
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
