Hi,

What would be the solution to this exercise:

What would be the solution to this exercise:

Thank you very much.Consider the set S of 10^n different words of length n with the 10 letters A, B, C, D, E, F, G, H, I and J. Partition S in subsets X1, X2, X3,...., Xk so that the following binary relation R holds:

For all a, b in Xi, a can be reproduced by rewriting the letters of b, in different order. Which of the relations "reflexive", "symmetric", "transitive" holds for R? Is it an equivalence relation?

Last edited: