Biological Computation

Molecular Computation    ◾    245

sticky end of the representation of the next input symbol. e sticky ends

depend on the representation of the symbol and the current state of the

automaton. For state q

1

we use the rst four bases of the symbol’s rep-

resentation, and for q

0

we use the last four bases of the representation.

e displacement from the beginning of the symbol’s representation is

denoted by ∆ and is in one-to-one correspondence with the state of the

automaton. In Table5.5 the sticky end is underlined for every symbol–

state combination.

Recall that the state transition function determines the next state as

a function of the current ...