ABSTRACT
Guideline A: (S0, S1) × 2 (meaning two times), (S0, S2) × 3, (S1, S2), (S0, S3) × 3, (S2, S3) × 2, (S1, S3). Guideline B: (S0, S1) × 3, (S0, S2), (S0, S3), (S1, S3).
Hence, the total weight for the following adjacencies is (S0, S1): 19, (S0, S2): 18, (S0, S3): 18, (S1, S2): 5, (S2, S3): 10, (S1, S3): 8. Therefore, the following assignments are given: S0 = 00, S1 = 01, S2 = 10, and S3 = 11, where the following adjacencies are satisfied: (S0, S1), (S0, S2), (S1, S3), and (S2, S3). Although this state assignment is not unique, it clearly yields efficient implementation.
