Chapter 9.5, Problem 52E

Exercises 52 and 53,R_nrefers to the family of equivalence relations defined inExample 5.Recall thats R_nt,wheresandtare two strings if $s=t$orsandtare strings with at leastncharacters that agree in their firstncharacters.

52. Show that the paron of the set of all bit strings formed by equivalence classes of bit strings with respect to the equivalence relationR₄is a refinement of the partition formed by equivalence classes of bit strings with respect to the equivalence relationR₃.