| OCR Text |
Show 79 that both states B and C have been activated and resets state A. Figure 15 shows the JOIN transition from states B and C to state F. Row 9 implements the forward transition by sensing that the predecessors state (A) is inactive, states B and C are active, inputs I, 15 and 10 are true, and by setting state F. The '+' in column 1 is used in generating the outputs associated with the JOIN trans'ition from state C. The reverse transition is implemented in row 8 where the acti vation of state F is detected and states B and C are deaet1 vated (reset) • Column' Number 1'1111111112222 023 5 b 7 901 2 5 b 7 9 0 , 2 R I 19 01 WI 1 I NI 17 01 • 1 I I I I I A 11ITl1111 111112131 I I I I 1 1 I 1 I I I I 1 I I B ITI11III1 C 1214151bl I I 1 I I I I 1 1 I I I I ITIII D 13171 I I 1 1 I I I 1 I ITIII E 141($1 I I I I I I F . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .... 9' 10 1 i_1_'_P_1_----------------SI ::: -::: --::::: -::::::::: 1-1-1-1-1-1-IR-----------R---P-----------------11 Figure 1.5: Compilation of toe JOIN Transition Figure 16 shows the compilation of the input boolean expression BIG _ 11 and (12 or not 13). The leftmost row seents on rows 20 and 21 (1+-1-PI and I+-P-OI respectively) compile the subexpression "12 or not 13." The' +' s in column 3 generate the OR of these two rows into T1. 12 is sensed by the '1' in column of row 20 and "not I3" is sensed by the '0' in column 5 of row 21. To sense BIG, the program must contain '1 "s in both columns 2 and 3. To sense "not BIG" it must |
