A Complex Example

Both normal and inverse words can appear in hierarchies. The example below shows a complex combination of an inverse word and hierarchies. Word13 is a word whose internal representation consists of one normal (1) bit and one inverse (0) bit. Because one of the bits is inverse, its value in any label not containing Word13 will be 1, as shown on the second line of the example. Word14 is a normal word in a hierarchy above Word13. The interesting result of this particular combination of hierarchies and inverse bits is that if Word13 is combined with any label that does not contain Word13, the resulting label contains Word14 instead of Word13.