The left component is readied for a new test by having the leftmost symbolof the "old" right component added to its right end.
The right component is "updated" by deleting thesymbol just added to the left component.
The "old" right and left components are deletedonly the "new" components for testing appear inthe state after two time-steps.
J4 signals that the punctuation test is to be reinitiatedfor the "new" components.
To cleave the string at the ith occurrence of I0,instead of the first, a count must be made of successive occurrences of I0. Since the signal J2 signals such an occurrence, this means counting successive occurrences of J2,restarting the process each time the count is incremented (by issuing the signal J3)until the count reaches i. The next example indicates how a binary counter can be set up to record the count.
5. The object is to count (modulo 2n) occurrences of a signal J2. The basic technique is illustrated by the construction of a one-stage binary counter. The transition function (table) for a one-stage binary counter is
Input at t
State at t
State at t + 1
J2 not present
S0
S0
J2 not present
S1
S1
J2
S0
S1
J2
S1
S0
The set of broadcast units which realizes this function for an initial state (signal) So is:
Makes current condition of input available for calculation of new state (on next time-step).
Makes current state available for calculation of new state (on next time-step).
*