Figure 1.

Finite automata and inputs for which we show molecular realizations. (A) Automaton A1. Incoming unlabeled arrow marks the initial state, and labeled arrows represent transition rules. A double circle represents an accepting state. (B) A computation of A1 scanning and digesting the input abba. Each row represents an intermediate configuration showing current state and remaining input. The transition rule applied is shown in brackets. (C) The two other automata for which we demonstrate molecular operation. (D) The set of inputs used as fuel.