Show that the partition of the set of bit strings of
Chapter 13, Problem 51E(choose chapter or problem)
Show that the partition of the set of bit strings of length 16 formed by equivalence classes of bit strings that agree on the last eight bits is a refinement of the partition formed from the equivalence classes of bit strings that agree on the last four bits.In Exercises 52 and 53, Rn refers to the family of equivalence relations defined in Example 5. Recall that s Rn t, where s and t are two strings if s = t or s and t are strings with at least n characters that agree in their first n characters.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer