Switching Theory and Logic Design

Appendix B: Symbolic Compatibles (For the Machine of Table 9.29)

This appendix complements the discussion of Section 9.9. While the machine under discussion is represented by Table B.1, its implication chart is given in Table B.2. All the compatibles together with their closure class sets are listed in Table B.3; the compatibles are grouped in accordance with their order (number of states in each compatible) and each group is listed in an alphabetical order. Deletions and exclusions are indicated in the remarks column by the letters D and E in the same notation used in Chapter 9. Table B.4 shows the implied compatibles and unimplied compatibles; the MICs and MUCs are noted below this table. Only one iteration suffices for this machine. Note ...