Denote by ∣x∣ the length of a string x. Therefore, (x,y)∈R if and only if ∣x∣=∣y∣. Then ∣x∣∈{1,2,3,4,5,6} for each x∈S. The equivalence class [x] of a bit string x is defined as [x]={v∈S : (v,x)∈R}={v∈S : ∣v∣=∣x∣}. Therefore, there are 6 equivalence classes. The partiton P={A1,A2,A3,A4,A5,A6} consist of 6 sets. The set Ai contains all bit string of length i for i∈{1,2,3,4,5,6}.
Comments